The Logic Behind Weighted CSP
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 32-36.
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.
Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, and Felip Manyà. 2007. The Logic Behind Weighted CSP. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 32–36. https://ijcai.org/proceedings/2007/3
Ansótegui, C., Bonet, M. L., Levy, J., & Manyà, F. (2007). The Logic Behind Weighted CSP. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 (pp. 32–36). IJCAI. https://ijcai.org/proceedings/2007/3
@inproceedings{ijcai2007p3,
title = {The Logic Behind Weighted CSP},
author = {Ansótegui, Carlos and Bonet, Maria Luisa and Levy, Jordi and Manyà, Felip},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {32--36},
year = {2007},
url = {https://ijcai.org/proceedings/2007/3},
}
TY - CPAPER TI - The Logic Behind Weighted CSP AU - Ansótegui, Carlos AU - Bonet, Maria Luisa AU - Levy, Jordi AU - Manyà, Felip T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 32 EP - 36 UR - https://ijcai.org/proceedings/2007/3 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: