Path Consistency by Dual Consistency

Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive singleton checks (i.e. enforcing arc consistency after the assignment of a value to a variable) in order to identify inconsistent pairs of values, until a fixpoint is reached. In this paper, we propose two new algorithms, denoted by sDC2 and sDC3, to enforce (strong) PC following the DC approach. These algorithms can be seen as refinements of Mac Gregor's algorithm as they partially and totally exploit the incrementality of the underlying Arc Consistency algorithm. While sDC3 admits the same interesting worst-case complexities as PC8, sDC2 appears to be the most robust algorithm in practice. Indeed, compared to PC8 and the optimal PC2001, sDC2 is usually around one order of magnitude faster on large instances.

[1]  Fahiem Bacchus,et al.  Generalized NoGoods in CSPs , 2005, AAAI.

[2]  Barry O'Sullivan,et al.  Automata for Nogood Recording in Constraint Satisfaction Problems , 2006 .

[3]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[4]  Lakhdar Sais,et al.  Nogood Recording from Restarts , 2007, IJCAI.

[5]  Frédéric Benhamou.  Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.

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

[7]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[8]  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).

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

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

[11]  Deepak Mehta,et al.  Reducing Checks and Revisions in Coarse-grained MAC Algorithms , 2005, IJCAI.

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

[13]  Moninder Singh,et al.  Path consistency revisited , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[14]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

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

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

[17]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

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

[19]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

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

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

[22]  D. J. Frost.  Carbon Dioxide Fugacities at High Temperature and Pressure , 1994 .

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

[24]  Philippe Jégou,et al.  (No)good Recording and ROBDDs for Solving Structured (V)CSPs , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).