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

Authors:
Eli Ben-Sasson;Jan Johannsen
Affiliations:
Computer Science Department, Technion – Israel Institute of Technology, Haifa, Israel;Institut für Informatik, LMU München, Munich, Germany
Venue:
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Year:
2010

Citing 17
Cited 5

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
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A machine program for theorem-proving

Communications of the ACM
An exponential separation between regular and general resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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

Clause-learning algorithms with many restarts and bounded-width resolution

Journal of Artificial Intelligence Research
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An empirical study of learning and forgetting constraints

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Exponential separations in a hierarchy of clause learning proof systems

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been observed empirically that clause learning does not significantly improve the performance of a SAT 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 resolution width lower bounds. This yields the first lower bounds on width-restricted clause learning for formulas in 3-CNF.