Lower bounds for width-restricted clause learning on formulas of small width

Authors:
Eli Ben-Sasson;Jan Johannsen
Affiliations:
Technion-Israel Institute of Technology, Haifa, Israel;LMU München, Munich, Germany
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 16
Cited 0

Short proofs for tricky formulas

Acta Informatica
On the expressive power of Datalog: tools and a case study

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A machine program for theorem-proving

Communications of the ACM
Short proofs are narrow—resolution made simple

Journal of the ACM (JACM)
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Optimality of size-width tradeoffs for resolution

Computational Complexity
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution

SIAM Journal on Computing
A combinatorial characterization of resolution width

Journal of Computer and System Sciences
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
An Exponential Lower Bound for Width-Restricted Clause Learning

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Clause learning can effectively P-simulate general propositional resolution

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
On the power of clause-learning SAT solvers with restarts

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clause learning is a technique used by backtracking-based propositional satisfiability solvers, where some clauses obtained by analysis of conflicts are added to the formula during backtracking. It has been observed empirically that clause learning does not significantly improve the performance of a solver when restricted to learning clauses of small width only. This experience is supported by lower bound theorems. It is shown that lower bounds on the runtime of width-restricted clause learning follow from lower bounds on the width of resolution proofs. This yields the first lower bounds on width-restricted clause learning for formulas in 3-CNF.