Rahul Bothra 2016A7PS0015P
Sankalp Sangle 2016A7PS0110P

1. To check whether a given binary relation is transitive over a given set.
2. To compute the transitive closure of a binary relation over a given set.
   

Additional details are given in Question.pdf

Note:

1. A, B are Lists.
2. C is a element.
3. S is a list of elements in the Set. (Input format: List of elements)
4. R is the binary relation on the set S. (Input Format: List of 2-element lists)
5. X is used to compute and return a value.

member(C,A): Builtin to check whether C is a member of A.
appendList(A,B,X): Appends A to B and returns them as X.
validRelation(S,R): Checks whether all elements in R belong to S.
transitiveCheck(R): Checks whether R is transitive.
transitive(S,R): Checks whether R is valid over S and is transitive.
closureCheck(R,X): Computes the transitive closure of the R and returns it as X.
closure(S,R): Checks whether R is valid over S and prints transitive closure of R.

1. Load the file answer.pl

swipl answer.pl

2. To check if a Relation R is transitive over a set S, type

transitive(S, R).

3. To compute transitive closure of a Relation R, type

closure(S,R).

4. To check whether a Relation R' is the transitive closure of Relation R, type

closureCheck(R,R').