Sciweavers

AMAI
2004
Springer
14 years 22 days ago
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...