Stable models and circumscription

作者：Ferraris Paolo; Lee Joohyung; Lifschitz Vladimir^*

来源：Artificial Intelligence, 2011, 175(1): 236-263.

DOI：10.1016/j.artint.2010.04.011

• Answer set programming
• Circumscription
• Nonmonotonic reasoning
• Program completion
• Stable models

The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based on a syntactic transformation similar to parallel circumscription.

• 出版日期2011-1