Overcoming Misleads In Logic Programs by Redefining Negation

interpreter for logic programs Input: a goal G and a program P Output: an instance of G that is a logical consequence of P, or no otherwise. Algorithm: 1 2 3 4 5 6 7 8 9 initialize the resolvent to G. while the resolvent is not empty do choose a goal A from the resolvent choose a (renamed) clause A’ B1, ..., Bn from P such that A and A’ unify with MGU Θ. (if no such goal and clause exist, exit the while loop) replace A by B1, ..., Bn in the resolvent apply Θ to the resolvent and to G if the resolvent is empty, then output G, else output no.