Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
DOI10.1016/J.ARTINT.2005.04.005zbMATH Open1132.68730OpenAlexW1981856605MaRDI QIDQ2457656FDOQ2457656
Authors: Alfonso E. Gerevini 
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
Recommendations
constraint satisfactioninterval calculusinterval algebraconstraint-based reasoningpoint algebrapoint calculusqualitative temporal reasoningtractable reasoningincremental reasoning
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Towards a general theory of action and time
- Temporally distributed symptoms in technical diagnosis
- Consistency in networks of relations
- Reasoning about temporal relations
- Title not available (Why is that?)
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Networks of constraints: Fundamental properties and applications to picture processing
- Efficient algorithms for qualitative reasoning about time
- Updating \(\leqslant, <\)-chains
- Sparsification—a technique for speeding up dynamic graph algorithms
- Combining topological and size information for spatial reasoning
- Complexity and algorithms for reasoning about time
- On binary constraint problems
- Unit Refutations and Horn Sets
- Reasoning about qualitative temporal information
- A spectrum of definitions for temporal model-based diagnosis
- On the computational complexity of dynamic graph problems
- Incremental algorithms for minimal length paths
- Twenty-one large tractable subclasses of Allen's algebra
- A comparison of point-based approaches to qualitative temporal reasoning
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amortized Computational Complexity
- Semidynamic algorithms for maintaining single-source shortest path trees
- Title not available (Why is that?)
- A Local Search Approach to Modelling and Solving Interval Algebra Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Cited In (10)
- Relation algebras of Sugihara, Belnap, Meyer, and Church
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- A comparison of point-based approaches to qualitative temporal reasoning
- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- Qualitative relations between moving objects in a network changing its topological relations
- Incremental processing of temporal observations in model-based reasoning
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
- Efficient algorithms for qualitative reasoning about time
- Implementation of the temporal reasoning mechanism in modern intelligent systems
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)
