An improved separation of regular resolution from pool resolution and clause learning

Authors:
Maria Luisa Bonet;Sam Buss
Affiliations:
Lenguajes y Sistemas Informáticos, Universidad Politécnica de Cataluña, Barcelona, Spain;Department of Mathematics, University of California, San Diego, CA
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 12
Cited 2

Short proofs for tricky formulas

Acta Informatica
A DNF without regular shortest consensus path

SIAM Journal on Computing
Regular resolution versus unrestricted resolution

SIAM Journal on Computing
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution

SIAM Journal on Computing
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 as resolution engines

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

Journal of Artificial Intelligence Research
A Near-Optimal Separation of Regular and General Resolution

SIAM Journal on Computing
Pool resolution and its relation to regular resolution and DPLL with clause learning

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Preliminary report on input cover number as a metric for propositional resolution proofs

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Producing and verifying extremely large propositional refutations

Annals of Mathematics and Artificial Intelligence
An improved separation of regular resolution from pool resolution and clause learning (extended abstract)

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the graph tautology principles of Alekhnovich, Johannsen, Pitassi and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. These graph tautology principles can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy, unit-propagating DPLL search.