Stable model semantics: Difference between revisions

Revision as of 14:52, 27 September 2018

Revision as of 10:02, 10 January 2019

Line 1:

The concept of a '''stable model''', or '''answer set''', is used to define a declarative [[declarativesemantics (computer science)|semantics]] for [[Logic programming|logic programs]] with [[negation as failure]]. This is one of several standard approaches to the meaning of [[negation]] in logic programming, along with [[Negation as failure#Completion semantics|program completion]] and the [[well-founded semantics]]. The stable model semantics is the basis of

[[answer set programming]].