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

Authors:
Luís Baptista;João P. Marques Silva
Affiliations:
-;-
Venue:
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Year:
2000

Citing 7
Cited 8

Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Algorithm portfolio design: theory vs. practice

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence

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

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
CSP(M): Constraint Satisfaction Problem over Models

MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Understanding the behavior of Solution-Guided Search for job-shop scheduling

Journal of Scheduling
Domain-splitting generalized nogoods from restarts

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
A complete random jump strategy with guiding paths

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Local search for unsatisfiability

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Dynamic constraint satisfaction problems over models

Software and Systems Modeling (SoSyM)
An overview of parallel SAT solving

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the interaction between randomization, with restart strategies, andl earning, 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 andu nsatisfiability. Finally, we utilize and expand the idea of algorithm portfolio design to propose an alternative approach for solving harduns atisfiable instances of SAT.