Stable models and circumscription

Paolo Ferraris; Joohyung Lee; Vladimir Lifschitz

doi:10.1016/j.artint.2010.04.011

Stable models and circumscription

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Research output: Contribution to journal › Article › peer-review

146 Scopus citations

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 language	English (US)
Pages (from-to)	236-263
Number of pages	28
Journal	Artificial Intelligence
Volume	175
Issue number	1
DOIs	https://doi.org/10.1016/j.artint.2010.04.011
State	Published - Jan 2011

Keywords

Answer set programming
Circumscription
Nonmonotonic reasoning
Program completion
Stable models

ASJC Scopus subject areas

Language and Linguistics
Linguistics and Language
Artificial Intelligence

Access to Document

10.1016/j.artint.2010.04.011

Cite this

@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",

note = "Funding Information: We are grateful to Pedro Cabalar, Martin Gebser, Michael Gelfond, Fangzhen Lin, David Pearce and Hudson Turner for useful discussions related to the topic of this paper. This work was partially supported by the National Science Foundation under Grants IIS-0712113, IIS-0839821, and IIS-0916116.",

year = "2011",

month = jan,

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

N1 - Funding Information: We are grateful to Pedro Cabalar, Martin Gebser, Michael Gelfond, Fangzhen Lin, David Pearce and Hudson Turner for useful discussions related to the topic of this paper. This work was partially supported by the National Science Foundation under Grants IIS-0712113, IIS-0839821, and IIS-0916116.

PY - 2011/1

Y1 - 2011/1

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

SN - 0004-3702

VL - 175

SP - 236

EP - 263

JO - Artificial Intelligence

JF - Artificial Intelligence

IS - 1

ER -

Stable models and circumscription

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this