The logic behind weighted CSP

Authors:
Carlos Ansótegui;María Luisa Bonet;Jordi Levy;Felip Manyà
Affiliations:
DIEI, UdL, Lleida, Spain;LSI, UPC, Barcelona, Spain;IIIA, CSIC, Bellaterra, Spain;IIIA, CSIC, Bellaterra, Spain
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 9
Cited 6

Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
New Logical and Complexity Results for Signed-SAT

ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Solving weighted CSP by maintaining arc consistency

Artificial Intelligence
In the quest of the best form of local consistency for weighted CSP

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Resolution in Max-SAT and its relation to local consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A complete calculus for Max-SAT

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Resolution for Max-SAT

Artificial Intelligence
Soft Constraints Processing over Divisible Residuated Lattices

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Inference rules for high-order consistency in weighted CSP

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
Mapping CSP into many-valued SAT

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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 toWeighted CSP instances.