Advertisement

On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas

  • K. Subramani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2550)

Abstract

This paper is concerned with the design of polynomial time algorithms to determine the shortest length, tree-like resolution refutation proofs for 2SAT and Q2SAT (Quantified 2SAT) clausal systems. Determining the shortest length resolution refutation has been shown to be NP-complete, even for HornSAT systems (for both tree-like and dag-like proofs); in fact obtaining even a linear approximation for such systems is NP-Hard. In this paper we demonstrate the existence of simple and efficient algorithms for the problem of determining the exact number of steps in the minimum length tree-like resolution refutation proof of a 2SAT or Q2SAT clausal system. To the best of our knowledge, our results are the first of their kind.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABM01]
    Achlioptas, Beame, and Molloy. A sharp threshold in proof complexity. In STOC: ACM Symposium on Theory of Computing (STOC), 2001.Google Scholar
  2. [ABMP98]
    M. Alekhnovich, S. Buss, S. Moran, and T. Pitassi. Minimum propositional proof length is np-hard to linearly approximate. In Mathematical Foundations of Computer Science (MFCS). Springer-Verlag, 1998. Lecture Notes in Computer Science.Google Scholar
  3. [APT79]
    Bengt Aspvall, Michael F. Plass, and Robert Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, (3), 1979.Google Scholar
  4. [BE]
    Alexander Bockmayr and Friedrich Eisnbrand. Combining logic and optimization in cutting plane theory. In Proceedings of Frontiers of Combining Systems (FROCOS) 2000, pages 1–17. Springer-Verlag. Lecure Notes in Artificial Intelligence.Google Scholar
  5. [BFW97]
    Azer Bestavros and Victor Fay-Wolfe, editors. Real-Time Database and Information Systems, Research Advances. Kluwer Academic Publishers, 1997.Google Scholar
  6. [BKA95]
    H. Kleine Buning, M. Karpinski, and A. Flogel. Resolution for quantified boolean formulas. Information and Computation, 117:12–18, 1995.CrossRefMathSciNetGoogle Scholar
  7. [BP96]
    Paul Beame and Toniann Pitassi. Simplified and improved resolution lower bounds. In 37th Annual Symposium on Foundations of Computer Science, pages 274–282, Burlington, Vermont, 14-16 October 1996. IEEE.Google Scholar
  8. [BP98]
    Paul Beame and Toniann Pitassi. Propositional proof complexity: Past, present, future. Bulletin of the EATCS, 65:66–89, June 1998.zbMATHMathSciNetGoogle Scholar
  9. [Bus]
    Samuel Buss. personal communication.Google Scholar
  10. [CR73]
    Stephen A. Cook and Robert A. Reckhow. Time bounded random access machines. Journal of Computer and System Sciences, 7(4):354–375, August 1973.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [Hak85]
    A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2-3):297–308, August 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [IM95]
    K. Iwama and E. Miyano. Intractability of read-once resolution. In Proceedings of the 10th Annual Conference on Structure in Complexity Theory (SCTC’ 95), pages 29–36, Los Alamitos, CA, USA, June 1995. IEEE Computer Society Press.Google Scholar
  13. [Iwa97]
    K. Iwama. Complexity of finding short resolution proofs. Lecture Notes in Computer Science, 1295:309–319, 1997.Google Scholar
  14. [Pap94]
    Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, 1994.zbMATHGoogle Scholar
  15. [Pud97]
    Pavel Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. The Journal of Symbolic Logic, 62(3):981–998, September 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [Raz96]
    Alexander A. Razborov. Lower bounds for propositional proofs and independence results in bounded arithmetic. In Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, volume 1099 of Lecture Notes in Computer Science, pages 48–62, Paderborn, Germany, 8-12 July 1996. Springer Verlag.Google Scholar
  17. [Urq95]
    Alasdair Urquhart. The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1(4):425–467, December 1995.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • K. Subramani
    • 1
  1. 1.LDCSEEWest Virginia UniversityMorgantown

Personalised recommendations