Understanding the power of clause learning

Authors:
Paul Beanie;Henry Kautz;Ashish Sabharwal
Affiliations:
Computer Science and Engineering, University of Washington, Seattle, WA;Computer Science and Engineering, University of Washington, Seattle, WA;Computer Science and Engineering, University of Washington, Seattle, WA
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 21
Cited 18

Diagnostic reasoning based on structure and behavior

Artificial Intelligence - Special volume on qualitative reasoning about physical systems
The use of design descriptions in automated diagnosis

Artificial Intelligence - Special volume on qualitative reasoning about physical systems
Short proofs for tricky formulas

Acta Informatica
Diagnosing multiple faults

Artificial Intelligence
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An exponential separation between regular and general resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

SIAM Journal on Computing
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Resolution cannot polynomially simulate compressed-BFS

Annals of Mathematics and Artificial Intelligence
The state of SAT

Discrete Applied Mathematics
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Towards an optimal separation of space and length in resolution

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Weighting strategy for non-clausal resolution

Journal of Experimental & Theoretical Artificial Intelligence
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
A case for simple SAT solvers

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Beyond unit propagation in SAT solving

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Clause-learning algorithms with many restarts and bounded-width resolution

Journal of Artificial Intelligence Research
Another complete local search method for SAT

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Resolution and pebbling games

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

Theoretical Computer Science
Dsharp: fast d-DNNF compilation with sharpSAT

Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
On the utility of landmarks in SAT based planning

Knowledge-Based Systems
Complexity issues related to propagation completeness

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is closely tied to how accurately data values are predicted at runtime. Caching ...