1.Previous
3.Next

When such a variable-free literal is selected, a subproof (or subcomputation) is attempted to determine whether there is an SLDNF refutation starting from the corresponding unnegated literal as top clause. The selected subgoal succeeds if the subproof fails, and it fails if the subproof succeeds.

See also

*John Alan Robinson

References

* Jean Gallier, chapter 9 of , 2003 online revision (free to download), originally published

1.Previous
3.Next