Separations between propositional proof systems related to clause learning
Seminar Room 1, Newton Institute
AbstractResolution trees with lemmas (RTL) are a resolution-based propositional proof system that is related to the DLL algorithm with clause learning, with its fragments RTL(k) being related to clause learning algorithms where the width of learned clauses is bounded by k. For every k up to O(log n), an exponential separation between the proof systems RTL(k) and RTL(k+1) is shown, indicating that a minimal increase in the width of learned clauses can lead to an exponential speed-up for clause learning algorithms.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.