A New Perspective on Stable Models
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 372-378.
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.
@inproceedings{ijcai2007p58,
title = {A New Perspective on Stable Models},
author = {Ferraris, Paolo and Lee, Joohyung and Lifschitz, Vladimir},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {372--378},
year = {2007},
url = {https://ijcai.org/proceedings/2007/58},
}
TY - CPAPER TI - A New Perspective on Stable Models AU - Ferraris, Paolo AU - Lee, Joohyung AU - Lifschitz, Vladimir T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 372 EP - 378 UR - https://ijcai.org/proceedings/2007/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
