A new approach to cyclic ordering of 2D orientations using ternary relation algebras
DOI10.1016/S0004-3702(00)00044-8zbMATH Open0948.68170OpenAlexW2031514991WikidataQ127861537 ScholiaQ127861537MaRDI QIDQ1583517FDOQ1583517
Authors: Amar Isli, Anthony G. Cohn 
Publication date: 26 October 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00044-8
Recommendations
computational complexityconstraint satisfactionorientationknowledge representationrelation algebraqualitative spatial reasoning
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Consistency in networks of relations
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations
- A Sufficient Condition for Backtrack-Free Search
- Reasoning about temporal relations
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
- From local to global consistency
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Networks of constraints: Fundamental properties and applications to picture processing
- Title not available (Why is that?)
- Qualitative spatial representation and reasoning: An overview
- On binary constraint problems
- Title not available (Why is that?)
- Partial and complete cyclic orders
- Reasoning about qualitative temporal information
- Cyclic ordering is NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Synthesizing constraint expressions
- Temporal reasoning based on semi-intervals
- Computational complexity of relating time points with intervals
- A method of spatial reasoning based on qualitative trigonometry
- Title not available (Why is that?)
Cited In (11)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- A condensed semantics for qualitative spatial reasoning about oriented straight line segments
- Qualitative reasoning about relative direction of oriented points
- Title not available (Why is that?)
- Reasoning with topological and directional spatial information
- A mixed integer linear programming formulation of the maximum betweenness problem
- A holistic approach to the composition of ternary relations
- Composing cardinal direction relations
- Reasoning about cardinal directions between extended objects
- Parameterized constraint satisfaction problems: a survey
This page was built for publication: A new approach to cyclic ordering of 2D orientations using ternary relation algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583517)
