Collapsibility in infinite-domain quantified constraint satisfaction

Bodirsky, M. and Chen, Hubie (2006) Collapsibility in infinite-domain quantified constraint satisfaction. In: Zoltan, E. (ed.) CSL 2006: Computer Science Logic. Lecture Notes in Computer Science 4207. Springer, pp. 197-211. ISBN 9783540454588.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/11874683_13

Abstract

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.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	09 Mar 2021 14:24
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43333

Statistics

Archive Staff Only (login required)

Edit/View Item