On the Computational Complexity of Spatial Logics with Connectedness Constraints

Authors:
Roman Kontchakov;Ian Pratt-Hartmann;Frank Wolter;Michael Zakharyaschev
Affiliations:
School of Computer Science, Birkbeck College London,;Department of Computer Science, Manchester University,;Department of Computer Science, University of Liverpool,;School of Computer Science, Birkbeck College London,
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 3
Cited 3

String graphs requiring exponential representations

Journal of Combinatorial Theory Series B
Recognizing string graphs in NP

Journal of Computer and System Sciences - STOC 2002
Contact Algebras and Region-based Theory of Space: A Proximity Approach - I

Fundamenta Informaticae

A Tableau-Based System for Spatial Reasoning about Directional Relations

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the computability of region-based euclidean logics

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Topological Logics with Connectedness over Euclidean Spaces

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computational complexity of spatial logics extended with the means to represent topological connectedness and restrict the number of connected components. In particular, we show that the connectedness constraints can increase complexity from NP to PSpace , ExpTime and, if component counting is allowed, to NExpTime .