On the consistency of cardinal direction constraints
DOI10.1016/J.ARTINT.2004.10.010zbMATH Open1132.68713OpenAlexW1982276524MaRDI QIDQ2457686
Manolis Koubarakis, Spiros Skiadopoulos
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2004.10.010
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maintaining knowledge about temporal intervals
- Reasoning about temporal relations
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- The complexity of query evaluation in indefinite temporal constraint databases
- Composing cardinal direction relations
- Reasoning about qualitative temporal information
- Qualitative representation of positional information
- Topological queries in spatial databases
- Querying temporal and spatial constraint networks in PTIME
- Modelling spatial relationships between colour clusters
Cited In (13)
- GNet: a generalized network model and its applications in qualitative spatial reasoning
- Qualitative reasoning with directional relations
- A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
- Reasoning with topological and directional spatial information
- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- A Logic of East and West
- Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
- Title not available (Why is that?)
- Qualitative reasoning about 2D cardinal directions using answer set programming
- Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra
- Reasoning about cardinal directions between extended objects: the NP-hardness result
- A model for describing and composing direction relations between overlapping and contained regions
- Reasoning about cardinal directions between extended objects
This page was built for publication: On the consistency of cardinal direction constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457686)
