Chen, Hubie (2003) Periodic constraint satisfaction problems: polynomial-time algorithms. In: Rossi, F. (ed.) 9th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2833. Springer, pp. 199-213. ISBN 9783540202028.
Abstract
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of “generating” constraints over a structured variable set that implicitly specifies a larger, possibly infinite set of constraints; the problem is to decide whether or not the larger set of constraints has a satisfying assignment. This model is natural for studying constraint networks consisting of constraints obeying a high degree of regularity or symmetry. Our main contribution is the identification of two broad polynomial-time tractable subclasses of the periodic CSP.
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:57 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43356 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
