Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on which these procedures have been effective are non-Boolean in that they are most naturally formulated in terms of variables with domain sizes greater than two. Approaches to solving non-Boolean satisfiability problems fall into two categories. In the direct approach, the problem is tackled by an algorithm for non-Boolean problems. In the transformation approach, the non-Boolean problem is reformulated as an equivalent Boolean problem and then a Boolean solver is used.This paper compares four methods for solving non-Boolean problems: one direct and three transformational. The comparison first examines the search spaces confronted by the four methods, and then tests their ability to solve random formulas, the round-robin sports scheduling problem, and the quasigroup completion problem. The experiments show that the relative performance of the methods depends on the domain size of the problem and that the direct method scales better as domain size increases.Along the route to performing these comparisons we make three other contributions. First, we generalize Walksat, a highly successful stochastic local search procedure for Boolean satisfiability problems, to work on problems with domains of any finite size. Second, we introduce a new method for transforming non-Boolean problems to Boolean problems and improve on an existing transformation. Third, we identify sufficient conditions for omitting at-least-one and at-most-one clauses from a transformed formula. Fourth, for use in our experiments we propose a model for generating random formulas that vary in domain size but are similar in other respects.

[1]  Ramón Béjar,et al.  A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas , 1999, ESCQARU.

[2]  Roberto Sebastiani,et al.  Applying GSAT to Non-Clausal Formulas , 1993, J. Artif. Intell. Res..

[3]  Ramón Béjar,et al.  Solving Combinatorial Problems with Regular Local Search Algorithms , 1999, LPAR.

[4]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[5]  Bart Selman,et al.  Generating Satisfiable Problem Instances , 2000, AAAI/IAAI.

[6]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

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

[8]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[9]  Ramón Béjar,et al.  Solving the Round Robin Problem Using Propositional Logic , 2000, AAAI/IAAI.

[10]  Henry Kautz,et al.  Exploiting Variable Dependency in Local Search , 1997, IJCAI 1997.

[11]  Steven David Prestwich,et al.  Local Search on SAT-encoded Colouring Problems , 2003, SAT.

[12]  Bart Selman,et al.  Problem Structure in the Presence of Perturbations , 1997, AAAI/IAAI.

[13]  Ramón Béjar,et al.  Capturing Structure with Satisfiability , 2001, CP.

[14]  T. Walsh,et al.  Arc Consistency and Quasigroup Completion , 2006 .

[15]  Joachim P. Walser.  Integer Optimization by Local Search , 2000, Lecture Notes in Computer Science.

[16]  Joachim P. Walser.  Solving Linear Pseudo-Boolean Constraint Problems with Local Search , 1997, AAAI/IAAI.

[17]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[18]  Charles J. Colbourn,et al.  Embedding Partial Steiner Triple Systems Is NP-Complete , 1983, J. Comb. Theory, Ser. A.

[19]  Bart Selman,et al.  Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.

[20]  Joachim Paul Walser,et al.  Integer Optimization by Local Search: A Domain-Independent Approach , 1999 .

[21]  Holger H. Hoos.  SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.

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

[23]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[25]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[26]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[27]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[28]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[29]  Hermann Stamm-Wilbrandt.  Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability) , 1993 .

[30]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

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

[32]  Ronen I. Brafman,et al.  To Encode or Not to Encode - Linear Planning , 1999, IJCAI.

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