Computer Software
Print ISSN : 0289-6540
GlueMiniSat 2.2.5: A Fast SAT Solver with An Aggressive Acquiring Strategy of Glue Clauses
Hidetomo NABESHIMAKoji IWANUMAKatsumi INOUE
Author information
JOURNAL FREE ACCESS

2012 Volume 29 Issue 4 Pages 4_146-4_160

Details
Abstract

The state-of-the-art SAT solvers have many successful results in the research of software and hardware verification, planning, scheduling, constraint satisfaction and optimization, and so on. GlueMiniSat 2.2.5 is a SAT solver based on literal blocks distance (LBD) proposed by Audemard and Simon which is an evaluation criteria to predict learnt clauses quality in CDCL solvers. The effectiveness of LBD was shown in their SAT solver Glucose 1.0 at SAT 2009 competition. GlueMiniSat uses a slightly modified concept of LBD, called pseudo LBD, and has an aggressive restart strategy to promote the generation of good learnt clauses. GlueMiniSat shows good performance for unsatisfiable SAT instances. In SAT 2011 competition, GlueMiniSat took the first and second places in sequential SAT solvers for UNSAT and SAT+UNSAT classes of the application category, respectively. Moreover, GlueMiniSat won the second place for UNSAT class in the category including parallel SAT solvers.

Content from these authors
© 2012 Japan Society for Software Science and Technology
Previous article Next article
feedback
Top