computational complexity

, Volume 10, Issue 4, pp 261–276

Optimality of size-width tradeoffs for resolution

  • Maria Luisa Bonet
  • Nicola Galesi
Research article

Abstract.

This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of Ben-Sasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence of our main result: we show the optimality of the general relationship called size-width tradeoffs in Ben-Sasson & Wigderson. Moreover we obtain the optimality of the size-width tradeoffs for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive.

Keywords. Resolution, complexity of proofs, automated theorem proving.¶ Subject classification. 03F20, 68T15, 03B05. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag, Basel 2001

Authors and Affiliations

  • Maria Luisa Bonet
    • 1
  • Nicola Galesi
    • 2
  1. 1.Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3,08034 Barcelona, Spain. E-mail: bonet@lsi.upc.esES
  2. 2.Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3,08034 Barcelona, Spain. E-mail: galesi@lsi.upc.esES

Personalised recommendations