A shorter model theory
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The computational complexity of quantified constraint satisfaction
The computational complexity of quantified constraint satisfaction
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Generalized Majority-Minority Operations are Tractable
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
Fixed-Parameter Hierarchies inside PSPACE
LICS '06 Proceedings of the 21st 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
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraints, consistency and closure
Artificial Intelligence
Positive first-order logic is NP-complete
IBM Journal of Research and Development
The complexity of equality constraint languages
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
Quantified Equality Constraints
SIAM Journal on Computing
| Hi-index | 0.00 |
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universal-algebraic ideas. We give applications illustrating the use of our technique.