BIROn - Birkbeck Institutional Research Online

    On the computational complexity of spatio-temporal logics

    Gabelaia, D. and Kontchakov, Roman and Kurucz, A. and Wolter, F. and Zakharyaschev, M. (2003) On the computational complexity of spatio-temporal logics. In: Russell, I. and Haller, S.M. (eds.) Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference. AAAI Press, pp. 460-464.

    Full text not available from this repository.

    Abstract

    Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a number of results on their computational properties were obtained, the most important questions were left open. In this paper, we solve these problems and provide a clear picture of the balance between expressiveness and "computational realisability" within the hierarchy.

    Metadata

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

    Statistics

    Downloads
    Activity Overview
    0Downloads
    19Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item