BIROn - Birkbeck Institutional Research Online

    Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms

    Chen, Hubie (2005) Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms. Electronic Colloquium on Computational Complexity 036 , ISSN 1433-8092.

    Full text not available from this repository.

    Abstract

    The constraint satisfaction problem (CSP) is a convenient framework for modelling search problems; the CSP involves deciding, given a set of constraints on variables, whether or not there is an assignment to the variables satisfying all of the constraints. This paper is concerned with the quantified constraint satisfaction problem (QCSP), a more general framework in which variables can be quantified both universally and existentially. We study the complexity of restricted cases of the QCSP where the types of constraints that may appear are restricted by a constraint language. We give a complete complexity classification of maximal constraint languages, the largest possible languages that can be tractable. We also give a complete complexity classification of constraint languages arising from symmetric polymorphisms.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 15:16
    Last Modified: 09 Mar 2021 15:16
    URI: https://eprints.bbk.ac.uk/id/eprint/43343

    Statistics

    Downloads
    Activity Overview
    0Downloads
    11Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item