Jump to content

Stable model semantics

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Macha (talk | contribs) at 08:15, 28 February 2006 (the idea and the main ref). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Stable model semantics was introduced by Gelfond and Lifschitz as a tool to provide a semantics for logic programs with negation. Their original proposal is now one of the standard semantics for logic programs. Stable model semantics relies on the closed world assumption to complete the available knowledge. It assumes that all atoms not entailed by a program are false, and is motivated by the fact that explicit representation of negative information in logic programs is not feasible.

The stable model semantics defines a whole family of models of (or 'answers to') a logic program and the minimal of these models according to the knowledge of information ordering is considered as the favourite, and is one-to-one related with the se-called well-founded semantics.

References

  • M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the Fifth Logic Programming Symposium, pp 1070-1080. The MIT Press, 1988.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Stable_model_semantics&oldid=41583917"