Part of the Lecture Notes in Computer Science book series (LNCS, volume 4501)
Minimum 2CNF Resolution Refutations in Polynomial Time
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
KeywordsPolynomial Time 2CNF Formula Empty Clause Joint Derivation Implication Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Alekhnovich, M., et al.: Minimum propositional proof length is NP-hard to linearly approximate. JSL: Journal of Symbolic Logic 66 (2001)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
© Springer Berlin Heidelberg 2007