BIROn - Birkbeck Institutional Research Online

    Collapsibility and consistency in quantified constraint satisfaction

    Chen, Hubie (2004) Collapsibility and consistency in quantified constraint satisfaction. In: McGuinness, D.L. and Ferguson, G. (eds.) Proceedings of the Nineteenth National Conference on Artificial Intelligence. AAAI, pp. 155-160.

    Full text not available from this repository.

    Abstract

    The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framework of the quantified constraint satisfaction problem (QCSP). We use these concepts to derive, in a uniform fashion, proofs of polynomial-time tractability and corresponding algorithms for certain cases of the QCSP where the types of allowed relations are restricted. We not only unify existing tractability results and algorithms, but also identify new classes of tractable QCSPs.

    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 15:52
    Last Modified: 09 Mar 2021 15:52
    URI: https://eprints.bbk.ac.uk/id/eprint/43345

    Statistics

    Downloads
    Activity Overview
    0Downloads
    18Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item