2000 character limit reached
Translation-based Constraint Answer Set Solving (1104.3927v1)
Published 20 Apr 2011 in cs.AI
Abstract: 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.