Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A lightweight component caching scheme for satisfiability solvers
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
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Artificial Intelligence
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Applying SMT in symbolic execution of microcode
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Cluster-based ASP solving with claspar
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
On freezing and reactivating learnt clauses
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
An overview of parallel SAT solving
Constraints
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Revisiting clause exchange in parallel SAT solving
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
The community structure of SAT formulas
SAT'12 Proceedings of the 15th 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
Augmenting clause learning with implied literals
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Refining restarts strategies for SAT and UNSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Clause sharing in parallel MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Decomposition and tractability in qualitative spatial and temporal reasoning
Artificial Intelligence
Asynchronous multi-core incremental SAT solving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying refutations with extended resolution
CADE'13 Proceedings of the 24th international conference on Automated Deduction
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
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
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Snappy: a simple algorithm portfolio
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Just-in-time compilation of knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
MACE4 and SEM: a comparison of finite model generators
Automated Reasoning and Mathematics
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
Proceedings of the International Conference on Computer-Aided Design
Hi-index | 0.00 |
Beside impressive progresses made by SAT solvers over the last ten years, only few works tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong and efficient on most industrial applications. We report in this work a key observation of CDCL solvers behavior on this family of benchmarks and explain it by an unsuspected side effect of their particular Clause Learning scheme. This new paradigm allows us to solve an important, still open, question: How to designing a fast, static, accurate, and predictive measure of new learnt clauses pertinence. Our paper is followed by empirical evidences that show how our new learning scheme improves state-of-the art results by an order of magnitude on both SAT and UNSAT industrial problems.