Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
From MaRDI portal
Publication:2457656
DOI10.1016/j.artint.2005.04.005zbMath1132.68730MaRDI QIDQ2457656
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.2005.04.005
constraint satisfaction; interval algebra; incremental reasoning; interval calculus; constraint-based reasoning; point algebra; point calculus; qualitative temporal reasoning; tractable reasoning
Related Items
Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure, Implementation of the temporal reasoning mechanism in modern intelligent systems, Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class, Qualitative relations between moving objects in a network changing its topological relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Updating \(\leqslant, <\)-chains
- Towards a general theory of action and time
- Temporally distributed symptoms in technical diagnosis
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- Semidynamic algorithms for maintaining single-source shortest path trees
- A spectrum of definitions for temporal model-based diagnosis
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- On the computational complexity of dynamic graph problems
- 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
- Reasoning about temporal relations
- Amortized Computational Complexity
- Incremental algorithms for minimal length paths
- Unit Refutations and Horn Sets
- Complexity and algorithms for reasoning about time
- On binary constraint problems
- Reasoning about temporal relations
- Sparsification—a technique for speeding up dynamic graph algorithms
- A Local Search Approach to Modelling and Solving Interval Algebra Problems
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
