Translation-based Constraint Answer Set Solving
Artificial Intelligence
2011-04-21 v1
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.
Cite
@article{arxiv.1104.3927,
title = {Translation-based Constraint Answer Set Solving},
author = {Christian Drescher and Toby Walsh},
journal= {arXiv preprint arXiv:1104.3927},
year = {2011}
}
Comments
Self-archived version for IJCAI'11 Best Paper Track submission