Constraint Answer Set Solving

  • Authors:
  • Martin Gebser;Max Ostrowski;Torsten Schaub

  • Affiliations:
  • Institut für Informatik, Universität Potsdam, Potsdam D-14482;Institut für Informatik, Universität Potsdam, Potsdam D-14482;Institut für Informatik, Universität Potsdam, Potsdam D-14482

  • Venue:
  • ICLP '09 Proceedings of the 25th International Conference on Logic Programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.