Skip to main content
Springer Nature Link
Log in

Minimum 2CNF Resolution Refutations in Polynomial Time

  • Conference paper
Theory and Applications of Satisfiability Testing – SAT 2007 (SAT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4501))

Abstract

We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alekhnovich, M., et al.: Minimum propositional proof length is NP-hard to linearly approximate. JSL: Journal of Symbolic Logic 66 (2001)

    Google Scholar 

  2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121–123 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Buresh-Oppenheim, J., Mitchell, D.: Minimum Witnesses for Unsatisfiable 2CNFs. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 42–47. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd Ann. ACM Symp. on Theory of Computing, pp. 151–158. ACM Press, New York (1971)

    Chapter  Google Scholar 

  5. del Val, A.: On 2-SAT and Renamable Horn. In: AAAI’2000, Proc. 17th (U.S.) National Conference on Artificial Intelligence, MIT Press, Cambridge (2000)

    Google Scholar 

  6. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5(4) (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Simon Fraser University,  

    Joshua Buresh-Oppenheim & David Mitchell

Authors
  1. Joshua Buresh-Oppenheim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

João Marques-Silva Karem A. Sakallah

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Buresh-Oppenheim, J., Mitchell, D. (2007). Minimum 2CNF Resolution Refutations in Polynomial Time. In: Marques-Silva, J., Sakallah, K.A. (eds) Theory and Applications of Satisfiability Testing – SAT 2007. SAT 2007. Lecture Notes in Computer Science, vol 4501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72788-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72788-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72787-3

  • Online ISBN: 978-3-540-72788-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation