Proceedings

Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2570-2574.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-428

Abstract

Clause learning is a technique used by back-tracking-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.

Eli Ben-Sasson, and Jan Johannsen. 2011. Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 2570–2574. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-428
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards