Temporal imagery: an approach to reasoning about time for planning and problem solving
Temporal imagery: an approach to reasoning about time for planning and problem solving
on Advances in artificial intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Logic for Artificial Intelligence
Logic for Artificial Intelligence
Planning using a temporal world model
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Deadlines, travel time, and robot problem solving
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Infinite qualitative simulations by means of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Temporal reasoning can be performed by maintaining a temporal relation network, a complete network in which the nodes are time intervals and each arc is the temporal relation between the two intervals which it connects. In this paper, we point out that the task of detecting inconsistency of the network and mapping the intervals onto a date line is a Consistent Labeling Problem (CLP). The problem is formalized and analyzed. The significance of identifying and analyzing the CLP in temporal reasoning is that CLPs have certain features which allow us to apply certain techniques to our problem. We also point out that the CLP exists when we reason with disjunctive temporal relations. Therefore, the intractability of the constraint propagation mechanism in temporal reasoning is inherent in the problem, not caused by the representation that we choose for time, as [Vilain & Kautz 86] claims.