Arc and path consistence revisited
Artificial Intelligence
Planning for conjunctive goals
Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Arc-consistency and arc-consistency again
Artificial Intelligence
Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Maintaining knowledge about temporal intervals
Communications of the ACM
Interpreting Tense, Aspect and Time Adverbials: A Compositional, Unified Approach
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
AI Communications - Special issue on: Spatial and temporal reasoning
Maintaining global consistency of temporal constraints in a dynamic environment
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
AI Communications - Spatial and Temporal Reasoning
A new crossover for solving constraint satisfaction problems
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Many applications such as planning, scheduling, computational linguistics and computational models for molecular biology involve systems capable of managing qualitative and metric time information. An important issue in designing such systems is the efficient handling of temporal information in an evolutive environment. In a previous work, we have developed a temporal model, TemPro, based on the interval algebra, to express such information in terms of qualitative and quantitative temporal constraints. In order to find a good policy for solving time constraints in a dynamic environment, we present in this paper, a study of dynamic arc-consistency algorithms in the case of temporal constraints. We show that, an adaptation of the new AC-3 algorithm presents promising results comparing to the other dynamic arc-consistency algorithms. Indeed, while keeping an optimal worst-case time complexity, this algorithm has a better space complexity than the other methods.