Translation-Based Constraint Answer Set Solving

Drescher, Christian; Walsh, Toby

doi:10.5591/978-1-57735-516-8/IJCAI11-432

Translation-Based Constraint Answer Set Solving

Christian Drescher, Toby Walsh

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2596-2600.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-432

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.

Christian Drescher, and Toby Walsh. 2011. Translation-Based Constraint Answer Set Solving. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 2596–2600. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-432

@inproceedings{ijcai2011p432,
  title     = {Translation-Based Constraint Answer Set Solving},
  author    = {Drescher, Christian and Walsh, Toby},
  booktitle = {Proceedings of the Twenty-Second International Joint Conference on
               Artificial Intelligence, {IJCAI-11}},
  publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
  editor    = {Toby Walsh},
  pages     = {2596--2600},
  year      = {2011},
  month     = {7},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-432},
  url       = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-432},
}

TY  - CPAPER
TI  - Translation-Based Constraint Answer Set Solving
AU  - Drescher, Christian
AU  - Walsh, Toby
T2  - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11
PB  - AAAI Press/International Joint Conferences on Artificial Intelligence
PY  - 2011
SP  - 2596
EP  - 2600
DO  - 10.5591/978-1-57735-516-8/IJCAI11-432
UR  - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-432
ER  -