Chen, Hubie (2004) Quantified constraint satisfaction and 2-semilattice polymorphisms. In: Wallace, Mark (ed.) 10th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 3258. Springer, pp. 168-181. ISBN 9783540232414.
Abstract
The quantified constraint satisfaction problem (QCSP) is a natural and useful generalization of the constraint satisfaction problem (CSP) in which both universal and existential quantification of variables is permitted. Because the CSP and QCSP are in general intractable, much effort has been directed towards identifying restricted cases of these problems that are tractable in polynomial time. In this paper, we investigate restricted cases of the QCSP having 2-semilattice polymorphisms. We prove a complete classification of 2-semilattice polymorphisms, demonstrating that each gives rise to a case of the QCSP that is either tractable in polynomial time, or coNP-hard.
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 16:07 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43347 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
