Translation-based constraint answer set solving
Christian Drescher, Toby Walsh · 2011
We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unitpropagation in the ASP solver achieves well defined local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach. 1