Looking algebraically at tractable quantified boolean formulas

Authors:
Hubie Chen;Víctor Dalmau
Affiliations:
Departament de Tecnologia, Universitat Pompeu Fabra, Barcelona, Spain;Departament de Tecnologia, Universitat Pompeu Fabra, Barcelona, Spain
Venue:
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Year:
2004

Citing 11
Cited 0

Resolution for quantified Boolean formulas

Information and Computation
Closure properties of constraints

Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems

Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems
A Dichotomy Theorem for Constraints on a Three-Element Set

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constraint Satisfaction Problems and Finite Algebras

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On 2-SAT and Renamable Horn

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On the Computational Complexity of Quantified Horn Clauses

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Tractable conservative Constraint Satisfaction Problems

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraints, consistency and closure

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 Kleine Büning, Subramani, and Zhao, and described proof-theoretically.