A new approach to cyclic ordering of 2D orientations using ternary relation algebras

DOI10.1016/S0004-3702(00)00044-8zbMath0948.68170OpenAlexW2031514991WikidataQ127861537 ScholiaQ127861537MaRDI QIDQ1583517

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

zbMATH Keywords

computational complexityknowledge representationrelation algebraorientationconstraint satisfactionqualitative spatial reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (9)

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey ⋮ Unnamed Item ⋮ Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables ⋮ A condensed semantics for qualitative spatial reasoning about oriented straight line segments ⋮ Qualitative reasoning about relative direction of oriented points ⋮ A mixed integer linear programming formulation of the maximum betweenness problem ⋮ Reasoning about cardinal directions between extended objects ⋮ REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION ⋮ Composing cardinal direction relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• A method of spatial reasoning based on qualitative trigonometry
• From local to global consistency
• Reasoning about qualitative temporal information
• Consistency in networks of relations
• Cyclic ordering is NP-complete
• A complete classification of tractability in Allen's algebra relative to subsets of basic relations
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Computational complexity of relating time points with intervals
• Networks of constraints: Fundamental properties and applications to picture processing
• Temporal reasoning based on semi-intervals
• A Sufficient Condition for Backtrack-Free Search
• Partial and complete cyclic orders
• Synthesizing constraint expressions
• On binary constraint problems
• Reasoning about temporal relations

This page was built for publication: A new approach to cyclic ordering of 2D orientations using ternary relation algebras