Looking Algebraically at Tractable Quantified Boolean Formulas


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… (More)
DOI: 10.1007/11527695_6


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics