Sciweavers

Share
CSL
2006
Springer

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

11 years 5 months ago
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.
Manuel Bodirsky, Hubie Chen
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where CSL
Authors Manuel Bodirsky, Hubie Chen
Comments (0)
books