Translation-Based Constraint Answer Set Solving
Drescher, Christian (NICTA and University of New South Wales) | Walsh, Toby (NICTA and University of New South Wales)
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.
Jul-19-2011
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- Europe > United Kingdom
- England > Cambridgeshire > Cambridge (0.04)
- Oceania > Australia
- Genre:
- Research Report > New Finding (0.46)
- Technology: