Abstract
General logic programs are programs that have clauses containing inequations and negative literals in their bodies. In this paper, the success and failure of general logic programs are defined mutually recursively. The pair of their interpretations are shown to be the least fixpoint of the inference function T defined on pairs of interpretations. Consequentially, with a complete equality theory, every model of the completed program contains the interpretation of the success set and does not meet that of the failure set. As a result, the soundness of SLDNF resolution and the negation-as-failure rule are proved. Necessary and sufficient conditions for completeness are also presented.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
