BIROn - Birkbeck Institutional Research Online

    Collapsibility in infinite-domain quantified constraint satisfaction

    Bodirsky, M. and Chen, Hubie (2006) Collapsibility in infinite-domain quantified constraint satisfaction. In: Zoltan, E. (ed.) CSL 2006: Computer Science Logic. Lecture Notes in Computer Science 4207. Springer, pp. 197-211. ISBN 9783540454588.

    Full text not available from this repository.

    Abstract

    In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universal-algebraic ideas. We give applications illustrating the use of our technique.

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

    Statistics

    Downloads
    Activity Overview
    0Downloads
    27Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item