Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä. Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. In AI&M 1-2004, Eighth International Symposium on Artificial Intelligence and Mathematics, January 4-6, 2004, Fort Lauderdale, Florida, USA. 2004. [doi]

@inproceedings{JarvisaloJN04,
  title = {Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits},
  author = {Matti Järvisalo and Tommi A. Junttila and Ilkka Niemelä},
  year = {2004},
  url = {http://rutcor.rutgers.edu/~amai/aimath04/AcceptedPapers/Jarvisalo-aimath04.pdf},
  researchr = {https://researchr.org/publication/JarvisaloJN04},
  cites = {0},
  citedby = {0},
  booktitle = {AI&M 1-2004, Eighth International Symposium on Artificial Intelligence and Mathematics, January 4-6, 2004, Fort Lauderdale, Florida, USA},
}