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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alekhnovich, M., et al.: Minimum propositional proof length is NP-hard to linearly approximate. JSL: Journal of Symbolic Logic 66 (2001)
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)
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)
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)
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)
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5(4) (1976)
Author information
Authors and Affiliations
Editor information
Rights 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)