Stable models and circumscription

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Research output: Contribution to journalArticlepeer-review

144 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)236-263
Number of pages28
JournalArtificial Intelligence
Issue number1
StatePublished - Jan 2011


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

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence


Dive into the research topics of 'Stable models and circumscription'. Together they form a unique fingerprint.

Cite this