On the Computational Complexity of Spatial Logics with Connectedness Constraints

DOI10.1007/978-3-540-89439-1_40zbMATH Open1182.68280OpenAlexW1580419439WikidataQ62048641 ScholiaQ62048641MaRDI QIDQ5505582FDOQ5505582

Authors: Roman Kontchakov, Ian Pratt-Hartmann, F. Wolter, Michael Zakharyaschev 

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

Recommendations

• Spatial logics with connectedness predicates
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Logics of space with connectedness predicates: complete axiomatizations
• Automata, Languages and Programming
• Satisfiability of a Spatial Logic with Tree Variables
• scientific article; zbMATH DE number 2081098
• A Spatial Logic for Simplicial Models
• Spatial logic and spatial model checking for closure spaces
• Undecidability results for multi-lane spatial logic
• Elimination of spatial connectives in static spatial logics

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Topological logics with connectedness over Euclidean spaces
• Topology, connectedness, and modal logic
• Logics of space with connectedness predicates: complete axiomatizations
• Title not available (Why is that?)
• An arrangement calculus, its complexity and algorithmic properties
• Extended contact algebras and internal connectedness
• Spatial logics with connectedness predicates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505582)