We provide a new perspective on the semantics of logic programs with arbitrary abstract constraints. To this end, we introduce several notions of computation. We use the results of computations to specify answer sets of programs with constraints. We present the rationale behind the classes of computations we consider, and discuss the relationships among them. We also discuss the relationships among the corresponding concepts of answer sets. One of those concepts has several compelling characterizations and properties, and we propose it as the correct generalization of the answer-set semantics to the case of programs with arbitrary constraints. We show that several other notions of an answer set proposed in the literature for programs with constraints can be obtained within our framework as the results of appropriately selected classes of computations.
|Number of pages||21|
|State||Published - Mar 2010|
Bibliographical noteFunding Information:
The authors wish to thank the anonymous reviewers for their insightful comments. This research has been partially supported by NSF grants 0812267 and 0420407.
- Answer sets
- Logic programs with abstract constraint atoms
ASJC Scopus subject areas
- Language and Linguistics
- Linguistics and Language
- Artificial Intelligence