Stable models and circumscription
by
Paolo Ferraris
,
Joohyung Lee
,
Vladimir Lifschitz
| Venue: | Artificial Intelligence |
| Citations: | 11 - 8 self |
BibTeX
@ARTICLE{Ferraris_stablemodels,
author = {Paolo Ferraris and Joohyung Lee and Vladimir Lifschitz},
title = {Stable models and circumscription},
journal = {Artificial Intelligence},
year = {},
pages = {2011}
}
OpenURL
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. 1







