The Quest for Efficient Boolean Satisfiability Solvers
Authors:
- 20 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 17-36
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Pruning Techniques for the SAT-Based Bounded Model Checking Problem2001
- The Impact of Branching Heuristics in Propositional Satisfiability Algorithms1999
- An Economics Approach to Hard Computational ProblemsScience, 1997
- SATO: An efficient propositional prover1997
- Combinational test generation using satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Branching rules for satisfiabilityJournal of Automated Reasoning, 1995
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960