Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking


Tommi A. Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic – CL 2000; First International Conference, volume 1861 of Lecture Notes in Artificial Intelligence, pages 553–567, London, UK, July 2000. Springer, Berlin.

Suggested BibTeX entry:

    address = {London, UK},
    author = {Tommi A. Junttila and Ilkka Niemel{\"a}},
    booktitle = {Computational Logic -- CL 2000; First International Conference},
    editor = {John Lloyd and Veronica Dahl and Ulrich Furbach and Manfred Kerber and Kung-Kiu Lau and Catuscia Palamidessi and Lu{\'i}s Moniz Pereira and Yehoshua Sagiv and Peter J. Stuckey},
    month = {July},
    pages = {553--567},
    publisher = {Springer, Berlin},
    series = {Lecture Notes in Artificial Intelligence},
    title = {Towards an Efficient Tableau Method for {Boolean} Circuit Satisfiability Checking},
    volume = {1861},
    year = {2000},

See ...