On qualitative route descriptions. Representation, agent models, and computational complexity

DOI10.1007/s10992-014-9333-7zbMath1347.68315OpenAlexW1595090857MaRDI QIDQ2341261

Bernhard Nebel, Jochen Renz, Stefan Wölfl, Matthias Westphal

Publication date: 23 April 2015

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-014-9333-7

zbMATH Keywords

spatial reasoningqualitative reasoningroute planningqualitative descriptionroute descriptions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

On qualitative route descriptions. Representation, agent models, and computational complexity

Cites Work

• The complexity of facets (and some facets of complexity)
• Application of modal logic to programming
• Some simplified NP-complete graph problems
• Propositional dynamic logic of regular programs
• The Spatial Semantic Hierarchy
• On qualitative route descriptions. Representation, agent models, and computational complexity
• Model checking propositional dynamic logic with all extras
• Propositional dynamic logic of looping and converse is elementarily decidable
• The Boolean Hierarchy I: Structural Properties
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On qualitative route descriptions. Representation, agent models, and computational complexity