Second-Order Consistencies

In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a full picture of the relationships existing between four basic second-order consistencies, namely path consistency (PC), 3-consistency (3C), dual consistency (DC) and 2-singleton arc consistency (2SAC), as well as their conservative and strong variants. Interestingly, dual consistency is an original property that can be established by using the outcome of the enforcement of generalized arc consistency (GAC), which makes it rather easy to obtain since constraint solvers typically maintain GAC during search. On binary constraint networks, DC is equivalent to PC, but its restriction to existing constraints, called conservative dual consistency (CDC), is strictly stronger than traditional conservative consistencies derived from path consistency, namely partial path consistency (PPC) and conservative path consistency (CPC). After introducing a general algorithm to enforce strong (C)DC, we present the results of an experimentation over a wide range of benchmarks that demonstrate the interest of (conservative) dual consistency. In particular, we show that enforcing (C)DC before search clearly improves the performance of MAC (the algorithm that maintains GAC during search) on several binary and non-binary structured problems.

[1]  Christophe Lecoutre,et al.  Conservative Dual Consistency , 2007, AAAI.

[2]  C FreuderEugene A Sufficient Condition for Backtrack-Free Search , 1982 .

[3]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[4]  Toby Walsh,et al.  Singleton Consistencies , 2000, CP.

[5]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[6]  Eugene C. Freuder A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[7]  Philippe Jégou Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

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

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

[10]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[11]  Toby Walsh,et al.  Domain filtering consistencies for non-binary constraints , 2008, Artif. Intell..

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

[13]  J. J. McGregor Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

[14]  Philippe Jégou,et al.  Efficient Path-Consistency Propagation , 1998, Int. J. Artif. Intell. Tools.

[15]  D. Shmoys,et al.  Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem , 2002 .

[16]  Toby Walsh,et al.  Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.

[17]  Christian Bessiere,et al.  Apprentissage de Contraintes Globales Implicites , 2005 .

[18]  Christophe Lecoutre,et al.  A Greedy Approach to Establish Singleton Arc Consistency , 2005, IJCAI.

[19]  Christophe Lecoutre,et al.  Backjump-based techniques versus conflict-directed heuristics , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[20]  Christian Bessiere,et al.  From Restricted Path Consistency to Max-Restricted Path Consistency , 1997, CP.

[21]  Christian Bessiere,et al.  Optimal and Suboptimal Singleton Arc Consistency Algorithms , 2005, IJCAI.

[22]  Eugene C. Freuder Synthesizing constraint expressions , 1978, CACM.

[23]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[24]  Christophe Lecoutre,et al.  Lightweight Detection of Variable Symmetries for Constraint Satisfaction , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[25]  Francesca Rossi,et al.  Constraint Relaxation may be Perfect , 1991, Artif. Intell..

[26]  Christophe Lecoutre,et al.  A Study of Residual Supports in Arc Consistency , 2007, IJCAI.

[27]  P. Berlandier Improving domain filtering using restricted path consistency , 1995, Proceedings the 11th Conference on Artificial Intelligence for Applications.

[28]  Cnrs Fre,et al.  Enforcing Arc Consistency using Bitwise Operations , 2007 .

[29]  Christophe Lecoutre Optimization of Simple Tabular Reduction for Table Constraints , 2008, CP.

[30]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[31]  Fahiem Bacchus,et al.  Extending Forward Checking , 2000, CP.

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

[33]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[34]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[35]  David A. Cohen,et al.  Domain permutation reduction for constraint satisfaction problems , 2008, Artif. Intell..

[36]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[37]  Philippe David,et al.  Using Pivot Consistency to Decompose and Solve Functional CSPs , 1994, J. Artif. Intell. Res..

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

[39]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[40]  Fahiem Bacchus,et al.  Unrestricted Nogood Recording in CSP Search , 2003, CP.

[41]  Toby Walsh,et al.  Inverse Consistencies for Non-Binary Constraints , 2006, ECAI.

[42]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[43]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[44]  R. H. C. Yap,et al.  Set Intersection and Consistency in Constraint Networks , 2006, J. Artif. Intell. Res..

[45]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[46]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[47]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[48]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[49]  Christophe Lecoutre,et al.  Path Consistency by Dual Consistency , 2007, CP.

[50]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[51]  Lakhdar Sais,et al.  Support Inference for Generic Filtering , 2004, CP.

[52]  Christian Bessiere,et al.  Theoretical analysis of singleton arc consistency and its extensions , 2008, Artif. Intell..

[53]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[54]  Djamila Sam-Haroud,et al.  Path Consistency on Triangulated Constraint Graphs , 1999, IJCAI.

[55]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[56]  Romuald Debruyne,et al.  A strong local consistency for constraint satisfaction , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.