1999/09/08 by Krzysztof R. Apt, Apt, Krzysztof R.
Computer Science · #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #D.3.3 #Data Management and Algorithms #Data Mining Algorithms and Applications #FOS: Computer and information sciences #I.1.2 #I.2.2 #Programming Languages (cs.PL) #cs.AI #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/9909009
23 pages. To appear in the Proc. 5th International Conference on Principles and Practice of Constraint Programming as an invited talk
arxiv created 1999/09/08 · openalex publication_date 1999/09/08 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.