BIROn - Birkbeck Institutional Research Online

    Looking algebraically at tractable quantified Boolean formulas

    Chen, Hubie and Dalmau, V. (2004) Looking algebraically at tractable quantified Boolean formulas. In: UNSPECIFIED (ed.) SAT 2004: The Seventh International Conference on Theory and Applications of Satisfiability Testing. Springer. ISBN 9783540278290.

    Full text not available from this repository.


    We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were given by B¨uning, Subramani, and Zhao, and described proof-theoretically.


    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 16:47
    Last Modified: 09 Mar 2021 16:47


    Activity Overview

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item