Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
From MaRDI portal
Publication:2457656
Recommendations
Cites work
- A comparison of point-based approaches to qualitative temporal reasoning
- A Local Search Approach to Modelling and Solving Interval Algebra Problems
- A spectrum of definitions for temporal model-based diagnosis
- Amortized Computational Complexity
- Combining topological and size information for spatial reasoning
- Complexity and algorithms for reasoning about time
- Consistency in networks of relations
- Efficient algorithms for qualitative reasoning about time
- scientific article; zbMATH DE number 4166933 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 140366 (Why is no real title available?)
- scientific article; zbMATH DE number 1096857 (Why is no real title available?)
- scientific article; zbMATH DE number 2043454 (Why is no real title available?)
- scientific article; zbMATH DE number 2207163 (Why is no real title available?)
- scientific article; zbMATH DE number 4185070 (Why is no real title available?)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
- Incremental algorithms for minimal length paths
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Maintaining knowledge about temporal intervals
- Networks of constraints: Fundamental properties and applications to picture processing
- On binary constraint problems
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- On the computational complexity of dynamic graph problems
- Reasoning about qualitative temporal information
- Reasoning about temporal relations
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Semidynamic algorithms for maintaining single-source shortest path trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- Temporally distributed symptoms in technical diagnosis
- Towards a general theory of action and time
- Twenty-one large tractable subclasses of Allen's algebra
- Unit Refutations and Horn Sets
- Updating \(\leqslant, <\)-chains
Cited in
(11)- A comparison of point-based approaches to qualitative temporal reasoning
- Efficient algorithms for qualitative reasoning about time
- Implementation of the temporal reasoning mechanism in modern intelligent systems
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Relation algebras of Sugihara, Belnap, Meyer, and Church
- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- 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
- Incremental processing of temporal observations in model-based reasoning
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
This page was built for publication: Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457656)
