Sciweavers

Share
CP
2000
Springer

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

9 years 11 months ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
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.
Luís Baptista, João P. Marques Silva
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where CP
Authors Luís Baptista, João P. Marques Silva
Comments (0)
books