Stable model semantics: Difference between revisions

Revision as of 14:06, 1 June 2013

Revision as of 15:13, 3 June 2013

Line 4:

==Motivation==

Research on the declarative semantics of negation in logic programming was motivated by the fact that the behavior of [[SLD_resolution#SLDNF|SLDNF]] resolution -- theresolution—the generalization of [[SLD resolution]] used by [[Prolog]] in the presence of negation in the bodies of rules -- doesrules—does not fully match the [[truth tables]] familiar from classical [[propositional logic]]. Consider, for instance, the program

:<math>p\ </math>

:<math>r \leftarrow p,\ q</math>

:<math>s \leftarrow p,\ \hbox{not } q.</math>