Introduction to
Logic Programming
What
versus
How
 

Exercise 9.5 - Directed Graphs


Consider a directed graph defined with a unary relation node and a binary base relation edge. Write rules to determine if the graph is asymmetric, i.e. if there is an arc from one node to a second node, then the graph does not contain an arc from the second to the first.