BIROn - Birkbeck Institutional Research Online

Spatial logics with connectedness predicates

Kontchakov, Roman and Pratt-Hartmann, I. and Wolter, F. and Zakharyaschev, Michael (2010) Spatial logics with connectedness predicates. Logical Methods in Computer Science 6 (3), pp. 1-43. ISSN 1860-5974.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.2168/LMCS-6(3:7)2010

Abstract

We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.

Item Type: Article
School or Research Centre: Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User: Administrator
Date Deposited: 31 Mar 2011 10:25
Last Modified: 17 Apr 2013 12:20
URI: http://eprints.bbk.ac.uk/id/eprint/3225

Archive Staff Only (login required)

Edit/View Item Edit/View Item