BIROn - Birkbeck Institutional Research Online

    Periodic constraint satisfaction problems: polynomial-time algorithms

    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.

    Full text not available from this repository.

    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: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 16:57
    Last Modified: 09 Mar 2021 16:57
    URI: https://eprints.bbk.ac.uk/id/eprint/43356

    Statistics

    Downloads
    Activity Overview
    0Downloads
    17Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item