Stable model semantics: Difference between revisions

Revision as of 09:27, 14 December 2008

Revision as of 00:54, 23 January 2009

Line 223:

===Program completion===

<math>Any stable model of a finite ground program is not only a model of the program itself, but also a model of its [[Negation as failure#Completion semantics|completion]] [Marek and Subrahmanian, 1989]. The converse, however, is not true. For instance, the completion of the one-rule program</math>

:<math>p \leftarrow p</math>