Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
From MaRDI portal
Publication:679419
DOI10.1007/BF00137869zbMath0870.68138OpenAlexW3012525065MaRDI QIDQ679419
Publication date: 22 April 1997
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00137869
Related Items (14)
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning ⋮ Temporal reasoning about fuzzy intervals ⋮ Modelling and solving temporal reasoning as propositional satisfiability ⋮ Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra ⋮ Twenty-one large tractable subclasses of Allen's algebra ⋮ Unnamed Item ⋮ Dynamic Branching in Qualitative Constraint Networks via Counting Local Models ⋮ Unnamed Item ⋮ Dynamic branching in qualitative constraint-based reasoning via counting local models ⋮ Branching interval algebra: an almost complete picture ⋮ A complete classification of tractability in Allen's algebra relative to subsets of basic relations ⋮ A new approach to cyclic ordering of 2D orientations using ternary relation algebras ⋮ Collective singleton-based consistency for qualitative constraint networks: theory and practice ⋮ Optimization in temporal qualitative constraint networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Temporally distributed symptoms in technical diagnosis
- Networks of constraints: Fundamental properties and applications to picture processing
- Complexity and algorithms for reasoning about time
- On binary constraint problems
- Reasoning about temporal relations
This page was built for publication: Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
