BIROn - Birkbeck Institutional Research Online

    Qualitative temporal and spatial reasoning revisited

    Bodirsky, M. and Chen, Hubie (2007) Qualitative temporal and spatial reasoning revisited. In: Duparc, J. and Henzinger, T.A. (eds.) Computer Science Logic: 21st International Workshop. Lecture Notes in Computer Science 4646. Springer, pp. 194-207. ISBN 9783540749141.

    Full text not available from this repository.

    Abstract

    Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various proposed temporal and spatial constraint languages is whether local consistency implies global consistency. Showing that a constraint language Γ has this “local-to-global” property implies polynomial-time tractability of the constraint language, and has further pleasant algorithmic consequences. In the present paper, we study the “local-to-global” property by making use of a recently established connection of this property with universal algebra. Specifically, the connection shows that this property is equivalent to the presence of a so-called quasi near-unanimity polymorphism of the constraint language. We obtain new algorithmic results and give very concise proofs of previously known theorems. Our results concern well-known and heavily studied formalisms such as the point algebra and its extensions, Allen’s interval algebra, and the spatial reasoning language RCC-5.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 02 Mar 2021 19:11
    Last Modified: 02 Mar 2021 19:11
    URI: https://eprints.bbk.ac.uk/id/eprint/43273

    Statistics

    Downloads
    Activity Overview
    0Downloads
    34Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item