Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

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 universalalgebraic ideas. We give applications illustrating the use of our technique.

• Type: Conference
• Year: 2006
• Where: CSL
• Authors: Manuel Bodirsky, Hubie Chen
• Keywords: Automated Reasoning, Complexity Upper Bounds, CSL 2006, Quantified Constraint Satisfaction, Technique Called Collapsibility