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

Luís Baptista, João Marques-Silva
2000 Lecture Notes in Computer Science  
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
more » ... nd expand the idea of algorithm portfolio design to propose an alternative approach for solving hard unsatisfiable instances of SAT. 1 The superscalar processor verification instances can be obtained from the URL
doi:10.1007/3-540-45349-0_36 fatcat:e3ciqfcyabdgvo5kp6bckoffte