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.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 09 Mar 2021 16:47 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43354 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
