Stable models and circumscription

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Research output: Contribution to journalArticle

107 Citations (Scopus)

Abstract

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
Volume175
Issue number1
DOIs
StatePublished - Oct 21 2010

Fingerprint

Electric grounding
Syntactics
programming
Semantics
semantics
Programming
Grounding
Syntax
Negation
Prolog

Keywords

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

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Stable models and circumscription. / Ferraris, Paolo; Lee, Joohyung; Lifschitz, Vladimir.

In: Artificial Intelligence, Vol. 175, No. 1, 21.10.2010, p. 236-263.

Research output: Contribution to journalArticle

Ferraris, Paolo ; Lee, Joohyung ; Lifschitz, Vladimir. / Stable models and circumscription. In: Artificial Intelligence. 2010 ; Vol. 175, No. 1. pp. 236-263.
@article{a8dbfdd49e6048d9824114cbd4086578,
title = "Stable models and circumscription",
abstract = "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.",
keywords = "Answer set programming, Circumscription, Nonmonotonic reasoning, Program completion, Stable models",
author = "Paolo Ferraris and Joohyung Lee and Vladimir Lifschitz",
year = "2010",
month = "10",
day = "21",
doi = "10.1016/j.artint.2010.04.011",
language = "English (US)",
volume = "175",
pages = "236--263",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Stable models and circumscription

AU - Ferraris, Paolo

AU - Lee, Joohyung

AU - Lifschitz, Vladimir

PY - 2010/10/21

Y1 - 2010/10/21

N2 - 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.

AB - 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.

KW - Answer set programming

KW - Circumscription

KW - Nonmonotonic reasoning

KW - Program completion

KW - Stable models

UR - http://www.scopus.com/inward/record.url?scp=70349869810&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349869810&partnerID=8YFLogxK

U2 - 10.1016/j.artint.2010.04.011

DO - 10.1016/j.artint.2010.04.011

M3 - Article

AN - SCOPUS:70349869810

VL - 175

SP - 236

EP - 263

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 1

ER -