Constraint Reductions
arXiv:2006.02081v1
Originality Synthesis-oriented
AI Analysis
This is an incremental analysis for constraint programming researchers, offering a classification framework without new experimental results.
The paper provides a commentary on a 2003 work about encoding boolean cardinality constraints, focusing on classifying constraints based on their deductive power regarding General Arc Consistency (GAC).
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).