The Logic Behind Weighted CSP

Abstract

We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an original exact algorithm for solving Weighted CSP. Finally, we define several derived rules and prove that they enforce the main soft arc consistency defined in the literature when applied to Weighted CSP instances. URL: www.iiia.csic.es/~levy/ansotegui.pdf

Cite

Text

Ansótegui et al. "The Logic Behind Weighted CSP." International Joint Conference on Artificial Intelligence, 2007. doi:10.1002/9780470612309.CH19

Markdown

[Ansótegui et al. "The Logic Behind Weighted CSP." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/ansotegui2007ijcai-logic/) doi:10.1002/9780470612309.CH19

BibTeX

@inproceedings{ansotegui2007ijcai-logic,
  title     = {{The Logic Behind Weighted CSP}},
  author    = {Ansótegui, Carlos and Bonet, Maria Luisa and Levy, Jordi and Manyà, Felip},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2007},
  pages     = {32-37},
  doi       = {10.1002/9780470612309.CH19},
  url       = {https://mlanthology.org/ijcai/2007/ansotegui2007ijcai-logic/}
}