On the Computational Complexity of Spatial Logics with Connectedness Constraints

DOI10.1007/978-3-540-89439-1_40zbMath1182.68280OpenAlexW1580419439WikidataQ62048641 ScholiaQ62048641MaRDI QIDQ5505582

Frank Wolter, Ian Pratt-Hartmann, Roman Kontchakov, Michael Zakharyashchev

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (1)

Extended contact algebras and internal connectedness

This page was built for publication: On the Computational Complexity of Spatial Logics with Connectedness Constraints