On the complexity of choosing the branching literal in DPLL
- 1 January 2000
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 116 (1-2) , 315-326
- https://doi.org/10.1016/s0004-3702(99)00097-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- No feasible interpolation for TC/sup 0/-Frege proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- SAT versus UNSATPublished by American Mathematical Society (AMS) ,1996
- Branching rules for satisfiabilityJournal of Automated Reasoning, 1995
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- On the Complexity of Derivation in Propositional CalculusPublished by Springer Nature ,1970
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960