Author:
LIERLER YULIYA,SUSMAN BENJAMIN
Abstract
AbstractConstraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the precise formal relation between them. We believe that this work will boost the cross-fertilization of the theoretical foundations and the existing solving methods in both areas. As a step in this direction, we provide a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiability modulo theories solvers for computing answer sets of constraint answer set programs.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference42 articles.
1. Gebser M. , Schaub T. and Thiele S. 2007. Gringo: A new grounder for answer set programming. In Proc. of 9th International Conference on Logic Programming and Nonmonotonic Reasoning, 266–271.
2. Lifschitz V. 2012. Logic programs with intensional functions. In Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR).
3. Negation as Failure
4. Denecker M. and Vennekens J. 2007. Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In Proc. of 9th International Conference Logic Programming and Nonmonotonic Reasoning (LPNMR), Tempe, AZ, USA, C. Baral , G. Brewka and J. S. Schlipf , Eds. Lecture Notes in Computer Science, vol. 4483. Springer International Publishing, 84–96.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献