Clausal Form? 1

[Whimsical]

Does anyone know how to convert prolog databases to clausal form? I have an assignment where I need to do an SLDNF proof, but before I can do that I need to convert some facts and rules from a prolog program into clausal form. My teacher gave us a 4 step process to do it but in the example he gives he doesn't use a statement from prolog.

So for example:

How would you convert "sibling(X, Y) :- parent(P, X), parent(P, Y), X \== Y" to clausal form?

 

[joel76]

This rule sibling(X, Y) :- parent(P, X), parent(P, Y), X \== Y. means that you have sibling(X, Y) if you have parent(P, X), parent(P, Y), X \== Y.
So
sibling(X, Y) :- parent(P, X), parent(P, Y), X \== Y is like
(parent(P, X), parent(P, Y), X \== Y) => sibling(X, Y)
which is translated as
(parent(P, X)/\ parent(P, Y) /\ not(X == Y)) => sibling(X, Y)
and knowing (a => b) is like (not(a) \/ b)
not((parent(P, X)/\ parent(P, Y) /\ not(X == Y))) \/ sibling(X, Y)
and
not(parent(P, X)) \/ not(parent(P, Y)) \/ (X == Y) \/ sibling(X, Y)

 

[Whimsical]

Thank you that makes sense