TCS / Research / Publications / Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Reference:

Tommi Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In Proceedings of the First International Conference on Computational Logic, Automated Deduction: Putting Theory into Practice, pages 553–567, London, U.K., July 2000. Springer-Verlag.

Suggested BibTeX entry:

@inproceedings{JN2000:cl,
    address = {London, U.K.},
    author = {Tommi Junttila and Ilkka Niemel{\"a}},
    booktitle = {Proceedings of the First International Conference on Computational Logic, Automated Deduction: Putting Theory into Practice},
    month = {July},
    pages = {553--567},
    publisher = {Springer-Verlag},
    title = {Towards an Efficient Tableau Method for {Boolean} Circuit Satisfiability Checking},
    year = {2000},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.