GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
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
Proceedings of the conference on Design, automation and test in Europe
Strong conflict analysis for propositional satisfiability
Proceedings of the conference on Design, automation and test in Europe: Proceedings
A new clause learning scheme for efficient unsatisfiability proofs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Towards a better understanding of the functionality of a conflict-driven SAT solver
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A generalized framework for conflict analysis
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Faster extraction of high-level minimal unsatisfiable cores
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generalized conflict-clause strengthening for satisfiability solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Two techniques for minimizing resolution proofs
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
CoPAn: exploring recurring patterns in conflict analysis of CDCL SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
A compact encoding of pseudo-boolean constraints into SAT
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Satisfiability solvers are static analysers
SAS'12 Proceedings of the 19th international conference on Static Analysis
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
Abstract conflict driven learning
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soundness of inprocessing in clause sharing SAT solvers
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Factoring out assumptions to speed up MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
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.