Minimum 2CNF resolution refutations in polynomial time

Authors:
Joshua Buresh-Oppenheim;David Mitchell
Affiliations:
Simon Fraser University;Simon Fraser University
Venue:
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Year:
2007

On 2-SAT and Renamable Horn

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Minimum witnesses for unsatisfiable 2CNFs

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Local backbones

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Hi-index	0.01

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