Articles
Extending the Reach of SAT with Many-Valued Logics

https://doi.org/10.1016/S1571-0653(04)00336-1Get rights and content

Abstract

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture problem structure more naturally. Furthermore, its simplicity allows us to develop Regular-SAT solvers that are competitive with SAT and CSP procedures. We present a detailed performance analysis of Regular-SAT on several benchmark domains. These results show a clear computational advantage of using a Regular-SAT approach over a pure Boolean SAT or CSP approach, at least on the domains under consideration. We therefore believe that an approach based on Regular-SAT provides a compelling intermediate approach between SAT and CSPs, bringing together some of the best features of each paradigm.

We would like to thank Bart Selman for useful comments and discussions that helped improve the paper.

References (20)

  • D. Achlioptas et al.

    Generating satisfiable problem instances

    Proc. of AAAI-2000

    (2000)
  • R.J. Bayardo et al.

    Using CSP look-back techniques to solve real-world SAT instances

    Proc. of AAAI'97

    (1997)
  • R. Béjar

    Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Autonoma de Barcelona

    (2000)
  • R. Béjar et al.

    Phase transitions in the regular random 3-SAT problem

    Proc. of ISMIS'99

    (1999)
  • J.C. Culberson et al.

    Exploring the k-colorable landscape with iterated greedy

    Cliques, Coloring and Satisfiability, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science.

    (1996)
  • M. Davis et al.

    A machine program for theorem-proving

    Communications of the ACM

    (1962)
  • C. Gomes et al.

    QWH - A structured benchmark domain for local search

    Technical Report, Intelligent Information Systems Institute (IISI), Cornell University

    (2001)
  • C. Gomes et al.
  • C.P. Gomes et al.

    Problem structure in the presence of perturbations

    Proc. of AAAI'97

    (1997)
There are more references available in the full text version of this article.

Cited by (0)

View full text