Complete extension of general logic programs (Q1190477): Difference between revisions

The author defines the declarative semantics of a general logic program. It requires the assignment of a system of axioms to the program \(P\), which is called the complete extension of \(P\). Then the relations between the different semantics of a positive program \(P\) are discussed. The soundness of the complete extension semantics is proved. However, although the negation-as-failure rule is still not complete with regard to the introduced semantics, the latter is closer than the Clark's one to the procedural semantics given by SLDNF-resolution.