A new perspective on stable models

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

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

99 Citations (Scopus)

Abstract

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
Pages372-379
Number of pages8
StatePublished - 2007
Event20th International Joint Conference on Artificial Intelligence, IJCAI 2007 - Hyderabad, India
Duration: Jan 6 2007Jan 12 2007

Other

Other20th International Joint Conference on Artificial Intelligence, IJCAI 2007
CountryIndia
CityHyderabad
Period1/6/071/12/07

Fingerprint

Electric grounding
Syntactics
Semantics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Ferraris, P., Lee, J., & Lifschitz, V. (2007). A new perspective on stable models. In IJCAI International Joint Conference on Artificial Intelligence (pp. 372-379)

A new perspective on stable models. / Ferraris, Paolo; Lee, Joohyung; Lifschitz, Vladimir.

IJCAI International Joint Conference on Artificial Intelligence. 2007. p. 372-379.

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

Ferraris, P, Lee, J & Lifschitz, V 2007, A new perspective on stable models. in IJCAI International Joint Conference on Artificial Intelligence. pp. 372-379, 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, Hyderabad, India, 1/6/07.
Ferraris P, Lee J, Lifschitz V. A new perspective on stable models. In IJCAI International Joint Conference on Artificial Intelligence. 2007. p. 372-379
Ferraris, Paolo ; Lee, Joohyung ; Lifschitz, Vladimir. / A new perspective on stable models. IJCAI International Joint Conference on Artificial Intelligence. 2007. pp. 372-379
@inproceedings{b0dd7490834446a4a0c4ecfdd2c39fb6,
title = "A new perspective on stable models",
abstract = "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.",
author = "Paolo Ferraris and Joohyung Lee and Vladimir Lifschitz",
year = "2007",
language = "English (US)",
pages = "372--379",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - A new perspective on stable models

AU - Ferraris, Paolo

AU - Lee, Joohyung

AU - Lifschitz, Vladimir

PY - 2007

Y1 - 2007

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:84880867448

SP - 372

EP - 379

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -