Translation-Based Constraint Answer Set Solving

IJCAI 2011 pp. 2596-2601

doi:10.5591/978-1-57735-516-8/IJCAI11-432 /ijcai/2011/drescher2011ijcai-translation/

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.

IJCAI Semantic Scholar

Cite

Text

Drescher and Walsh. "Translation-Based Constraint Answer Set Solving." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-432

Markdown

[Drescher and Walsh. "Translation-Based Constraint Answer Set Solving." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/drescher2011ijcai-translation/) doi:10.5591/978-1-57735-516-8/IJCAI11-432

BibTeX

@inproceedings{drescher2011ijcai-translation,
  title     = {{Translation-Based Constraint Answer Set Solving}},
  author    = {Drescher, Christian and Walsh, Toby},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {2596-2601},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-432},
  url       = {https://mlanthology.org/ijcai/2011/drescher2011ijcai-translation/}
}