The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
Author:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 62-74
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Satisfiability Problem: Theory and Applications1997
- SATO: An efficient propositional prover1997
- Using CSP look-back techniques to solve exceptionally hard SAT instances1996
- Branching rules for satisfiabilityJournal of Automated Reasoning, 1995
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- Analysis of dependencies to improve the behaviour of logic programs1980
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysisArtificial Intelligence, 1977
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960