Full Dynamic Substitutability by SAT Encoding

Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeability. Automatically detecting full interchangeability is thought to be intractable, so research has focused on either discovery of local interchangeability or programmer knowledge of full interchangeability. This paper shows that full dynamic substitutability can be broken in a CSP by reformulating it as a SAT problem. No analysis is necessary, space requirements are modest, solutions are collected into Cartesian products, and unit propagation enforces forward checking on the CSP. In experiments on unsatisfiable problems, better results are obtained than with standard SAT encodings.

[1]  Rolf Backofen,et al.  Excluding Symmetries in Constraint-Based Search , 1999, CP.

[2]  Toby Walsh,et al.  Solving Non-clausal Formulas with DPLL search , 2004, SAT.

[3]  Rainer Weigel,et al.  On Reformulation of Constraint Satisfaction Problems , 1998, ECAI.

[4]  Peter van Beek,et al.  On the conversion between non-binary constraint satisfaction problems , 1998, AAAI 1998.

[5]  Matthias F. Stallmann,et al.  The Role of a Skeptic Agent in Testing and Benchmarking of SAT Algorithms , 2002 .

[6]  Berthe Y. Choueiry,et al.  Context in Discrete Constraint Satisfaction Problems , 1996, ECAI.

[7]  Steve Linton,et al.  Tractable Symmetry Breaking Using Restricted Search Trees , 2004, ECAI.

[8]  Steven Prestwich.  Full Dynamic Interchangeability with Forward Checking and Arc Consistency , .

[9]  Berthe Y. Choueiry,et al.  Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs , 2005, AAAI.

[10]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

[11]  Ian P. Gent,et al.  Symmetry breaking during search in constraint programming , 1999 .

[12]  Eugene C. Freuder,et al.  An Efficient Cross Product Representation of the Constraint Satisfaction Problem Search Space , 1992, AAAI.

[13]  Guevara Noubir,et al.  On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[14]  Eugene C. Freuder,et al.  Interchangeability Preprocessing Can Improve Forward Checking Search , 1992, ECAI.

[15]  Pascal Van Hentenryck,et al.  Tractable Symmetry Breaking for CSPs with Interchangeable Values , 2003, IJCAI.

[16]  Carme Torras,et al.  Exploiting symmetries within constraint satisfaction search , 2001, Artif. Intell..

[17]  Belaid Benhamou,et al.  Study of symmetry in Constraint Satisfaction Problems , 1994 .

[18]  David Lesaint,et al.  Maximal Sets of Solutions for Constraint Satisfaction Problems , 1994, ECAI.

[19]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[20]  Andrew J. Parkes.  Exploiting Solution Clusters for Coarse-Grained Distributed Search , 2001 .

[21]  Warwick Harvey,et al.  Groups and Constraints: Symmetry Breaking during Search , 2002, CP.

[22]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[23]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.

[24]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[25]  James Bowen,et al.  Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems , 2009, IJCAI.

[26]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[27]  Peter van Beek,et al.  On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[28]  Marius-Calin Silaghi,et al.  Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation , 1999, New Trends in Constraints.

[29]  Berthe Y. Choueiry,et al.  How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search , 2001, Australian Joint Conference on Artificial Intelligence.

[30]  Stefano Bistarelli,et al.  Interchangeability in Soft CSPs , 2002, CP.

[31]  Ian P. Gent,et al.  Symmetry Breaking in Constraint Programming , 2000, ECAI.

[32]  Berthe Y. Choueiry,et al.  Dynamic Bundling: Less Effort for More Solutions , 2002, SARA.

[33]  Toby Walsh,et al.  Local Consistencies in SAT , 2003, SAT.

[34]  Charles J. Petrie,et al.  On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.

[35]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.