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