On the power of top-down branching heuristics

Authors:
Matti Järvisalo;Tommi Junttila
Affiliations:
Helsinki University of Technology, Department of Information and Computer Science, Finland;Helsinki University of Technology, Department of Information and Computer Science, Finland
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 13
Cited 2

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

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

Communications of the ACM
Circuit-based Boolean Reasoning

Proceedings of the 38th annual Design Automation Conference
The complexity of analytic tableaux

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver

Proceedings of the 39th annual Design Automation Conference
A short proof of the pigeon hole principle using extended resolution

ACM SIGACT News
A Circuit SAT Solver With Signal Correlation Guided Learning

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica
Unrestricted vs restricted cut in a tableau method for Boolean circuits

Annals of Mathematics and Artificial Intelligence
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Limitations of restricted branching in clause learning

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Robust Boolean reasoning for equivalence checking and functional property verification

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Limitations of restricted branching in clause learning

Constraints
Structure-based satisfiability checking: Analyzing and harnessing the potential

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying the style of branching and (ii) enforcing dynamic restrictions on the decision heuristics. Considering DPLL both with and without clause learning, we present a relative efficiency hierarchy for refinements of DPLL resulting from combinations of decision heuristics (top-down restricted, justification restricted, and unrestricted heuristics) and branching styles (typical DPLL-style and ATPG-style branching). An an example, for DPLL without clause learning, we establish a strict hierarchy, with the ATPG-style, justification restricted branching variant as the weakest system.