BIROn - Birkbeck Institutional Research Online

    On the decidability of connectedness constraints in 2D and 3D Euclidean spaces

    Kontchakov, Roman and Nenov, Y. and Pratt-Hartmann, I. and Zakharyaschev, Michael (2011) On the decidability of connectedness constraints in 2D and 3D Euclidean spaces. In: Walsh, T. (ed.) Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. California, U.S.: AAAI Press, pp. 957-962. ISBN 9781577355120.

    [img]
    Preview
    Text
    iIJCAI-7.1.pdf - Author's Accepted Manuscript

    Download (202kB) | Preview

    Abstract

    We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies dramatically depending on the dimension of the space and on the type of regions considered. For example, the logic with the interior-connectedness predicate (and without contact) is undecidable over polygons or regular closed sets in the Euclidean plane, NP-complete over regular closed sets in three-dimensional Euclidean space, and ExpTime-complete over polyhedra in three-dimensional Euclidean space.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 13 May 2013 08:58
    Last Modified: 13 Feb 2021 19:03
    URI: https://eprints.bbk.ac.uk/id/eprint/6638

    Statistics

    Downloads
    Activity Overview
    99Downloads
    167Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item