Bodirsky, M. and Chen, Hubie and Kara, J. and von Oertzen, T. (2007) Maximal infinite-valued constraint languages. In: Arge, L. and Cachin, C. and Jurdzinski, T. and Tarlecki, A. (eds.) ICALP 2007: Automata, Languages and Programming, 34th International Colloquium. Lecture Notes in Computer Science 4596. Springer, pp. 546-557. ISBN 9783540734192.
Abstract
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the wellestablished notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ù-categorical structure, then maximal constraint languages are in one-to-one correspondence to minimal oligomorphic clones. Based on this correspondence, we derive general tractability and hardness criteria for the corresponding constraint satisfaction problems.
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: | 02 Mar 2021 19:18 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43274 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
