The Rough Guide to Constraint Propagation
Krzysztof R. Apt
TL;DR
This paper introduces a unified framework for understanding various constraint propagation algorithms using concepts like commutativity, simplifying their analysis and showing how many are instances of a single generic algorithm.
Contribution
It presents a general, simplified framework explaining multiple constraint propagation algorithms through the notions of commutativity and semi-commutativity.
Findings
AC-3, PC-2, DAC, DPC are instances of a single generic algorithm
The framework simplifies understanding and analysis of constraint propagation algorithms
Extends previous work by Apt with a more general and simplified approach
Abstract
We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In particular, using the notions commutativity and semi-commutativity, we show how the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt, cs.AI/9811024.
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 · Data Management and Algorithms · Data Mining Algorithms and Applications