The role of commutativity in constraint propagation algorithms

Constraing propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we introduce a generic iteration algorithm on partial orderings and prove its correctness in an abstract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the notions commutativity and semi-commutativity, we show that the AC-3, PC-2, DAC, and DPC algorithms for achieving (directional) arc consistency and (directional) path consistency are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt [1999a].

[1]  Francesca Rossi,et al.  Constraint Propagation for Soft Constraints: Generalization and Termination Conditions , 2000, CP.

[2]  R. Gennari.  Arc Consistency via Subsumed Functions , 2000 .

[3]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[4]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

[5]  Krzysztof R. Apt,et al.  The Essence of Constraint Propagation , 1998, Theor. Comput. Sci..

[6]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[7]  Krzysztof R. Apt,et al.  The Rough Guide to Constraint Propagation , 1999, CP.

[8]  Eric Monfroy.  A coordination-based chaotic iteration algorithm for constraint propagation , 2000, SAC '00.

[9]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[10]  Philippe Codognet,et al.  Compiling Constraints in clp(FD) , 1996, J. Log. Program..

[11]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[12]  Franco Zambonelli,et al.  Coordination of Internet Agents: Models, Technologies, and Applications , 2014, Coordination of Internet Agents: Models, Technologies, and Applications.

[13]  Vitaly Telerman,et al.  Data Types in Subdefinite Models , 1996, AISMC.

[14]  Frédéric Benhamou,et al.  Applying Interval Arithmetic to Real, Integer, and Boolean Constraints , 1997, J. Log. Program..

[15]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[16]  Farhad Arbab,et al.  Constraints Solving as the Coordination of Inference Engines , 2001, Coordination of Internet Agents: Models, Technologies, and Applications.

[17]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[18]  R. Dechter.  to Constraint Satisfaction , 1991 .

[19]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[20]  Peter van Beek,et al.  Local and Global Relational Consistency , 1995, Theor. Comput. Sci..

[21]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[22]  Gert Smolka,et al.  The Oz Programming Model , 1996, Computer Science Today.

[23]  Eric Monfroy.  Using “weaker” functions for constraint propagation over real numbers , 1999, SAC '99.

[24]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[25]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[26]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[27]  Rosella Gennari.  Arc Consistency Algorithms via Iterations of Subsumed Functions , 2000, Computational Logic.

[28]  Francesca Rossi,et al.  Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions , 2000 .

[29]  Eric Monfroy,et al.  Chaotic iteration for distributed constraint propagation , 1999, SAC '99.

[30]  Frédéric Benhamou,et al.  Heterogeneous Constraint Solving , 1996, ALP.