Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä

    Research output: Contribution to journalArticleScientificpeer-review

    31 Citations (Scopus)
    Original languageEnglish
    Pages (from-to)373-399
    JournalAnnals of Mathematics and Artificial Intelligence
    Volume44
    Issue number4
    DOIs
    Publication statusPublished - 2005
    MoE publication typeA1 Journal article-refereed

    Keywords

    • Boolean circuits
    • cut rule
    • DPLL
    • proof complexity
    • satisfiability

    Cite this