Exponential Separations in a Hierarchy of Clause Learning Proof Systems

  • Jan Johannsen
Conference paper

DOI: 10.1007/978-3-642-39071-5_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Johannsen J. (2013) Exponential Separations in a Hierarchy of Clause Learning Proof Systems. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg

Abstract

Resolution trees with lemmas (RTL) are a resolution-based propositional proof system that is related to the DPLL algorithm with clause learning. Its fragments \(\ensuremath{\ensuremath{\mathrm{RTL}} ({k})}\) are related to clause learning algorithms where the width of learned clauses is bounded by k.

For every k up to O(logn), an exponential separation between the proof systems \(\ensuremath{\ensuremath{\mathrm{RTL}} ({k})}\) and \(\ensuremath{\ensuremath{\mathrm{RTL}} ({k+1})}\) is shown.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jan Johannsen
    • 1
  1. 1.Institut für InformatikLudwig-Maximilians-Universität MünchenGermany

Personalised recommendations