|
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.
Hubert Ming Chen and Manuel Bodirsky
In: CSL 2006, Szeged, Hungary(2006).
AbstractIn 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.
| EPrint Type: | Conference or Workshop Item (Paper) |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 2715 |
|---|
| Deposited By: | Hubert Ming Chen |
|---|
| Deposited On: | 22 November 2006 |
|---|
[Edit]
| 