Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1998: Computer Science Logic pp 171–178Cite as

An Upper Bound for Minimal Resolution Refutations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1584))

Abstract

We consider upper bounds for minimal resolution refutations of propositional formulas in CNF. We show that minimal refutations of minimal unsatisfiable formulas over n variables and n+k clauses consist of at most 2k − 1 n 2 applications of the resolution rule.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aharoni, R., Linial, N.: Minimal Non–Two–Colorable Hypergraphs and Minimal Unsatisfiable Formulas. Journal of Combinatorial Theory 43, 196–204 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beame, P., Pitassi, T.: Simplified and Improved Resolution Lower Bounds. In: FOCS 1996, pp. 274–282 (1996)

    Google Scholar 

  3. Chvatal, V., Szemeredi, T.: Many hard Exanples for Resolution. Journal of the Association for Computing Maschinery 35, 759–768 (1988)

    MATH  MathSciNet  Google Scholar 

  4. Davydov, G., Davydova, I., Kleine Büning, H.: An Effcient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. To appear in Annals of Mathematics and Artificial Intelligence

    Google Scholar 

  5. Fu, X.: On the Complexity of Proof Systems. University of Toronto, PhD Thesis (1995)

    Google Scholar 

  6. Haken, A.: The intractibility of Resolution. Theoretical Computer Science 39, 297–308 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Urquhart, A.: Hard Examples for Resolution. Journal of ACM 34, 209–219 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, 33095, Paderborn, Germany

    Hans Kleine Büning

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building Parks Road Oxford,, OX1 3QD, United Kingdom

    Georg Gottlob

  2. GREYC, Université de Caen, CNRS, Campus 2, F-14032, Caen cedex, France

    Etienne Grandjean

  3.  ,  

    Katrin Seyr

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Büning, H.K. (1999). An Upper Bound for Minimal Resolution Refutations. In: Gottlob, G., Grandjean, E., Seyr, K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_12

Download citation

  • DOI: https://doi.org/10.1007/10703163_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65922-8

  • Online ISBN: 978-3-540-48855-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation