A new perspective on stable models

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

122 Scopus citations


The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to 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 (including disjunctive rules, choice rules and conditional literals) and, unlike the original definition, refers neither to grounding nor to fixpoints. Rather, it is based on a syntactic transformation, which turns a logic program into a formula of second-order logic that is similar to the formula familiar from the definition of circumscription.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Number of pages8
StatePublished - 2007
Event20th International Joint Conference on Artificial Intelligence, IJCAI 2007 - Hyderabad, India
Duration: Jan 6 2007Jan 12 2007


Other20th International Joint Conference on Artificial Intelligence, IJCAI 2007

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'A new perspective on stable models'. Together they form a unique fingerprint.

Cite this