AAAI Publications, Twenty-Second International Joint Conference on Artificial Intelligence

Font Size: 
Translation-Based Constraint Answer Set Solving
Christian Drescher, Toby Walsh

Last modified: 2011-06-29


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.

Full Text: PDF