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 for quantified Horn formulas that were given by Kleine Buning, Subramani, and Zhao, and described proof-theoretically.

[1]  Peter Jeavons,et al.  Constraint Satisfaction Problems and Finite Algebras , 2000, ICALP.

[2]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[4]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[5]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[6]  Peter Jeavons,et al.  An Algebraic Approach to Multi-sorted Constraints , 2003, CP.

[7]  Hans Kleine Büning,et al.  Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

[8]  Enn Tyugu,et al.  Constraint Programming , 1994, NATO ASI Series.

[9]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[10]  P. Jeavons.  Algebraic structures in combinatorial problems , 2001 .

[11]  Peter Jeavons,et al.  Tractable constraints closed under a binary operation , 2000 .

[12]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[13]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[14]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[15]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[16]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[17]  Ian P. Gent,et al.  Solving 2-CNF Quantified Boolean Formulae using Variable Assignment and Propagation , 2002 .

[18]  Hubie Chen,et al.  (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability , 2004, CP.

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[20]  A. Bulatov.  Combinatorial problems raised from 2-semilattices , 2006 .

[21]  Peter Jeavons,et al.  Quantified Constraints: Algorithms and Complexity , 2003, CSL.

[22]  Hans Kleine Büning,et al.  On the Computational Complexity of Quantified Horn Clauses , 1987, CSL.

[23]  Hans Kleine Büning,et al.  On Boolean Models for Quantified Boolean Horn Formulas , 2003, SAT.

[24]  Alvaro del Val.  On 2-SAT and Renamable Horn , 2000, AAAI/IAAI.