Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
From MaRDI portal
Publication:543614
DOI10.1016/j.artint.2010.10.004zbMath1216.68266OpenAlexW2050262935MaRDI QIDQ543614
Alessandro Saetti, Alfonso E. Gerevini
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.10.004
constraint-based reasoningminimal relationsgraph-based reasoningpoint algebrapoint calculusqualitative temporal reasoningsimple interval algebratemporal CSPtemporal relations and constraintstractable reasoning
Related Items
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning, On redundant topological constraints, Relation algebras of Sugihara, Belnap, Meyer, and Church
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Temporally distributed symptoms in technical diagnosis
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- Twenty-one large tractable subclasses of Allen's algebra
- Combining topological and size information for spatial reasoning
- A comparison of point-based approaches to qualitative temporal reasoning
- Networks of constraints: Fundamental properties and applications to picture processing
- Efficient algorithms for qualitative reasoning about time
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Combining qualitative and quantitative constraints in temporal reasoning
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
- The Recognition of Series Parallel Digraphs
- Complexity and algorithms for reasoning about time
- On binary constraint problems
- Reasoning about temporal relations
