Incremental Algorithms for Managing Temporal Constraints

Authors:
Alfonso Gerevini;Anna Perini;Francesco Ricci
Affiliations:
-;-;-
Venue:
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Year:
1996

Citing 0
Cited 5

Combining topological and size information for spatial reasoning

Artificial Intelligence
Interactive Case-Based Planning for Forest Fire Management

Applied Intelligence
Incremental qualitative temporal reasoning: algorithms for the point algebra and the ORD-Horn class

Artificial Intelligence
Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class

Artificial Intelligence
Time-Dependent simple temporal networks

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of efficiently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a subclass of STP for which we propose new fast incremental algorithms for consistency checking and for maintaining the feasible times of the temporal variables.