SAT as an Effective Solving Technology for Constraint Problems

In this paper we investigate the use of SAT technology for solving constraint problems. In particular, we solve many instances of several common benchmark problems for CP with different SAT solvers, by exploiting the declarative modelling language NPSpec, and Spec2Sat, an application that allows us to compile NPSpec specifications into SAT instances. Furthermore, we start investigating whether some reformulation techniques already used in CP are effective when using SAT as solving engine. We present encouraging experimental results in this direction, showing that this approach can be appealing.

[1]  James M. Crawford,et al.  Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.

[2]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[3]  Weixiong Zhang,et al.  Backbone Guided Local Search for Maximum Satisfiability , 2003, IJCAI.

[4]  Pascal Van Hentenryck,et al.  Localizer , 2004, Constraints.

[5]  Toni Mancini,et al.  Automated reformulation of specifications by safe delay of constraints , 2004, Artif. Intell..

[6]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[7]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[8]  Luigi Palopoli,et al.  NP-SPEC: an executable specification language for solving all problems in NP , 2000, Comput. Lang..

[9]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[10]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[11]  Toni Mancini,et al.  Exploiting functional dependencies in declarative problem specifications , 2004, Artif. Intell..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Holger H. Hoos,et al.  Stochastic local search - methods, models, applications , 1998, DISKI.

[14]  Marco Cadoli,et al.  : Compiling problem specifications into SAT , 2005, Artif. Intell..

[15]  Holger H. Hoos,et al.  Stochastic Local Search-Methods , 1998 .

[16]  S. Prestwich,et al.  Supersymmetric Modeling for Local Search , 2002 .

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

[18]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[19]  Andrea Roli,et al.  Symmetry Breaking and Local Search Spaces , 2005, CPAIOR.

[20]  Pascal Van Hentenryck,et al.  Control Abstractions for Local Search , 2003, Constraints.

[21]  Barbara M. Smith,et al.  Reducing Symmetry in a Combinatorial Design Problem , 2001 .

[22]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[23]  Toby Walsh,et al.  Breaking Row and Column Symmetries in Matrix Models , 2002, CP.

[24]  Toni Mancini,et al.  Exploiting Functional Dependencies in Declarative Problem Specifications , 2004, JELIA.

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

[26]  Toni Mancini,et al.  Detecting and breaking symmetries on specications , 2003 .

[27]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[28]  Luigi Palopoli,et al.  NP-SPEC: an executable specification language for solving all problems in NP , 1999, Comput. Lang..

[29]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[30]  Toni Mancini,et al.  Detecting and Breaking Symmetries by Reasoning on Problem Specifications , 2005, SARA.

[31]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[32]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[33]  Toni Mancini,et al.  USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS , 2005, AI*IA.

[34]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..