Speedup techniques utilized in modern SAT solvers

Authors:
Matthew D. T. Lewis;Tobias Schubert;Bernd W. Becker
Affiliations:
Chair of Computer Architecture, Institute of Computer Science, Albert-Ludwigs-University of Freiburg, Germany;Chair of Computer Architecture, Institute of Computer Science, Albert-Ludwigs-University of Freiburg, Germany;Chair of Computer Architecture, Institute of Computer Science, Albert-Ludwigs-University of Freiburg, Germany
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 8
Cited 1

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Dynamic restart policies

Eighteenth national conference on Artificial intelligence
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Efficient Data Structures for Backtrack Search SAT Solvers

Annals of Mathematics and Artificial Intelligence

Parallel SAT solving in bounded model checking

FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes and compares features and techniques modern SAT solvers utilize to maximize performance. Here we focus on: Implication Queue Sorting (IQS) combined with Early Conflict Detection Based BCP (ECDB); and a modified decision heuristic based on the combination of Variable State Independent Decaying Sum (VSIDS), Berkmin, and Siege's Variable Move to Front (VMTF). These features were implemented and compared within the framework of the MIRA SAT solver. The efficient implementation and analysis of these features are presented and the speedup and robustness each feature provides is demonstrated. Finally, with everything enabled (ECDB with IQS and advanced decision heuristics), MIRA was able to consistently outperform zChaff and even Forklift on the benchmarks provided, solving 37 out of 111 industrial benchmarks compared to zChaff's 21 and Forklift's 28.