Periodic constraint satisfaction problems: tractable subclasses

Chen, Hubie (2005) Periodic constraint satisfaction problems: tractable subclasses. Constraints 10 (2), pp. 97-113. ISSN 1383-7133.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/s10601-005-0551-z

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:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	09 Mar 2021 14:51
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43340

Statistics

Archive Staff Only (login required)