Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
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
The computational complexity of quantified constraint satisfaction
The computational complexity of quantified constraint satisfaction
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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 more general framework of quantified constraint satisfaction, in which variables can be quantified both universally and existentially. We study the relatively quantified constraint satisfaction problem (RQCSP), in which the values for each individual variable can be arbitrarily restricted. We give a complete complexity classification of the cases of the RQCSP where the types of constraints that may appear are specified by a constraint language.