Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Liu, L., Pontelli, E., Son, T. C., & Truszczyńki, M. (2007). Logic programs with abstract constraint atoms: The role of computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4670 LNCS, pp. 286–301). Springer Verlag. https://doi.org/10.1007/978-3-540-74610-2_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
