Stable model semantics: Difference between revisions

Revision as of 18:56, 24 February 2019

Revision as of 13:05, 4 April 2019

Line 342:

Testing whether a finite set of propositional formulas has a stable model is [[Polynomial hierarchy|<math>\Sigma_2^{\rm P}</math>-complete]], as in the case of [[#Disjunctive programs|disjunctive programs]].

== See also ==

* [[Answer set programming]]

* [[Logic programming]]

* [[Negation as failure]]

==Notes==

{{Reflist}}

Line 363 ⟶ 367:

* D. Pearce [1997] ''[http://ai2-s2-pdfs.s3.amazonaws.com/37f3/19f2f8af842631ff9972e1bfd91b99f93511.pdf A new logical characterization of stable models and answer sets]''. In: Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57–70.

* [[Raymond Reiter|R. Reiter]] [1980] ''[http://www.umiacs.umd.edu/~horty/courses/readings/reiter-default-1980.pdf A logic for default reasoning]''. Artificial Intelligence, Vol. 13, pages 81–132.

== See also ==

* [[Answer set programming]]

* [[Logic programming]]

* [[Negation as failure]]

[[Category:Logic programming]]