Towards a general theory of action and time
Artificial Intelligence
A formal theory of plan recognition
A formal theory of plan recognition
Introduction to algorithms
Computational Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
An episodic knowledge representation for narrative texts
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Temporally distributed symptoms in technical diagnosis
Temporally distributed symptoms in technical diagnosis
Temporal reasoning and planning
Reasoning about plans
A formal theory of plan recognition and its implementation
Reasoning about plans
Incremental algorithms for minimal length paths
Journal of Algorithms
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Efficient algorithms for qualitative reasoning about time
Artificial Intelligence
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Twenty-one large tractable subclasses of Allen's algebra
Artificial Intelligence
An efficient algorithm for managing partial orders in planning
ACM SIGART Bulletin
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
A spectrum of definitions for temporal model-based diagnosis
Artificial Intelligence
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
A comparison of point-based approaches to qualitative temporal reasoning
Artificial Intelligence
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information Processing Letters
Combining topological and size information for spatial reasoning
Artificial Intelligence
On-line Graph Algorithms for Incremental Compilation
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Incremental Algorithms for Managing Temporal Constraints
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
The Rhetorical Knowledge Representation System Reference Manual (for Rhet Version 17.9)
The Rhetorical Knowledge Representation System Reference Manual (for Rhet Version 17.9)
A Local Search Approach to Modelling and Solving Interval Algebra Problems
Journal of Logic and Computation
On finding a solution in temporal constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Incremental tractable reasoning about qualitative temporal constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A simple way to improve path consistency processing in interval algebra networks
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Qualitative relations between moving objects in a network changing its topological relations
Information Sciences: an International Journal
Hi-index | 0.00 |
In many applications of temporal reasoning we are interested in processing temporal information incrementally. In particular, given a set of temporal constraints (a temporal CSP) and a new constraint, we want to maintain certain properties of the extended temporal CSP (e.g., a solution), rather than recomputing them from scratch. The Point Algebra (PA) and the Interval Algebra (IA) are two well-known frameworks for qualitative temporal reasoning. The reasoning algorithms for PA and the tractable fragments of IA, such as Nebel and Bürckert's maximal tractable class of relations (ORD-Horn), have originally been designed for "static" reasoning.In this paper, we study the incremental version of the fundamental reasoning problems in the context of these tractable classes. We propose a collection of new polynomial algorithms that can amortize their complexity when processing a sequence of input constraints to incrementally decide satisfiability, to maintain a solution, or to update the minimal representation of the CSP. Our incremental algorithms improve the total time complexity of using existing static techniques by a factor of O(n) or O(n2), where n is the number of the variables involved by the temporal CSP. An experimental analysis focused on constraints over PA confirms the computational advantage of our incremental approach.