Translation-Based Constraint Answer Set Solving

We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unit-propagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.

Authors

• Christian Drescher NICTA and University of New South Wales
• Toby Walsh UNSW Sydney

Keywords

No keywords are indexed for this paper.