Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability

  • Luís Baptista
  • João Marques-Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1894)

Abstract

This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT from the hardware verification domain to provide evidence that randomization can indeed be essential in solving real-world satisfiable instances of SAT. More interestingly, our results indicate that randomized restarts and learning may cooperate in proving both satisfiability and unsatisfiability. Finally, we utilize and expand the idea of algorithm portfolio design to propose an alternative approach for solving hard unsatisfiable instances of SAT.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Baptista and J. P. Marques-Silva. The interplay of randomization and learning on real-world instances of satisfiability. In AAAI Workshop on Leveraging Probability and Uncertatinty in Computation, July 2000.Google Scholar
  2. 2.
    R. Bayardo Jr. and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the National Conference on Artificial Intelligence, 1997.Google Scholar
  3. 3.
    C. P. Gomes and B. Selman. Algorithm portfolio design: Theory vs. practice. In Proceedings of the Thirteenth Conference On Uncertainty in Artificial Intelligence, 1997.Google Scholar
  4. 4.
    C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of the National Conference on Artificial Intelligence, July 1998.Google Scholar
  5. 5.
    C. M. Li and Anbulagan. Look-ahead versus look-back for satisfiability problems. In Proceedings of International Conference on Principles and Practice of Constraint Programming, 1997.Google Scholar
  6. 6.
    J. P. Marques-Silva and K. A. Sakallah. GRASP-A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506–521, May 1999.Google Scholar
  7. 7.
    M. N. Velev and R. E. Bryant. Superscalar processor verification using efficient reductions from the logic of equality with uninterpreted functions to propositional logic. In Proceedings of Correct Hardware Design and Verification Methods, LNCS 703, pages 37–53, September 1999.Google Scholar
  8. 8.
    H. Zhang. SATO: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction, pages 272–275, July 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Luís Baptista
    • 1
  • João Marques-Silva
    • 1
  1. 1.Department of InformaticsTechnical University of Lisbon, IST/INESC/CELLisbonPortugal

Personalised recommendations