TY - GEN
T1 - Minimizing Learned Clauses
AU - Sörensson, Niklas
AU - Biere, Armin
PY - 2009
Y1 - 2009
N2 - Minimizing learned clauses is an effective technique to reduce
memory usage and also speed up solving time. It has been implemented
in MINISAT since 2005 and is now adopted by most modern SAT solvers
in academia, even though it has not been described in the literature
properly yet. With this paper we intend to close this gap and also provide
a thorough experimental analysis of it's effectiveness for the first time.
AB - Minimizing learned clauses is an effective technique to reduce
memory usage and also speed up solving time. It has been implemented
in MINISAT since 2005 and is now adopted by most modern SAT solvers
in academia, even though it has not been described in the literature
properly yet. With this paper we intend to close this gap and also provide
a thorough experimental analysis of it's effectiveness for the first time.
UR - https://www.scopus.com/pages/publications/70350624371
U2 - 10.1007/978-3-642-02777-2_23
DO - 10.1007/978-3-642-02777-2_23
M3 - Conference proceedings
SN - 3642027768
SN - 9783642027765
VL - 5584
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 237
EP - 243
BT - Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings
A2 - Oliver Kullmann, null
PB - Springer
ER -