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
The Inverse Satisfiability Problem
SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
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
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
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
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constraints, consistency and closure
Artificial Intelligence
Learning intersection-closed classes with signatures
Theoretical Computer Science
Relatively quantified constraint satisfaction
Constraints
Existentially restricted quantified constraint satisfaction
Information and Computation
The complexity of constraint satisfaction games and QCSP
Information and Computation
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Meditations on quantified constraint satisfaction
Logic and Program Semantics
| Hi-index | 0.00 |
The constraint satisfaction problem (CSP) is a convenient framework for modelling search problems; the CSP involves deciding, given a set of constraints on variables, whether or not there is an assignment to the variables satisfying all of the constraints. This paper is concerned with the quantified constraint satisfaction problem (QCSP), a more general framework in which variables can be quantified both universally and existentially. We study the complexity of restricted cases of the QCSP where the types of constraints that may appear are restricted by a constraint language. We give a complete complexity classification of maximal constraint languages, the largest possible languages that can be tractable. We also give a complete complexity classification of constraint languages arising from symmetric polymorphisms.