We provide new perspectives on the semantics of logic programs with constraints. To this end we introduce several notions of computation and propose to use the results of computations as answer sets of programs with constraints. We discuss the rationale behind different classes of computations and study the relationships among them and among the corresponding concepts of answer sets. The proposed semantics generalize the answer set semantics for programs with monotone, convex and/or arbitrary constraints described in the literature.
|Title of host publication
|Logic Programming - 23rd International Conference, ICLP 2007, Proceedings
|Number of pages
|Published - 2007
|23rd International Conference on Logic Programming, ICLP 2007 - Porto, Portugal
Duration: Sep 8 2007 → Sep 13 2007
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|23rd International Conference on Logic Programming, ICLP 2007
|9/8/07 → 9/13/07
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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)