Abstract
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different solver types. We have implemented our approach, combining ASP solver clingo with the generic CP solver gecode, and we empirically investigate its computational impact. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Gebser, M., Ostrowski, M., & Schaub, T. (2009). Constraint answer set solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 235–249). https://doi.org/10.1007/978-3-642-02846-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
