Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Reference:

Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. AI&M 15–2004, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/.

Suggested BibTeX entry:

@misc{JarvisaloJunttilaNiemela:AIMath04,
    author = {Matti J{\"a}rvisalo and Tommi Junttila and Ilkka Niemel{\"a}},
    howpublished = {AI\&M 15--2004, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4--6},
    note = {Proceedings available at {\tt http://rutcor.rutgers.edu/%7Eamai/aimath04/}},
    title = {Unrestricted vs Restricted Cut in a Tableau Method for {B}oolean Circuits},
    year = {2004},
}