Constraint Reductions
Olivier Bailleux (LIB), Yacine Boufkhad (LIAFA)
TL;DR
This paper discusses the classification of constraints based on their ability to achieve General Arc Consistency, providing insights into the efficiency of CNF encodings for boolean cardinality constraints.
Contribution
It offers a classification framework for constraints based on their deductive power related to GAC, building on prior work on CNF encodings.
Findings
Constraints vary in their deductive power for GAC
Provides a classification scheme for constraints
Highlights implications for CNF encoding efficiency
Abstract
This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc Consistency (GAC).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Logic, Reasoning, and Knowledge · Logic, programming, and type systems