Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
A metric time-point and duration-based temporal model
ACM SIGART Bulletin
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Temporal reasoning with qualitative and quantitative information about points and durations
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
’’Corner‘‘ Relations in Allen‘s algebra
Constraints
Qualitative temporal reasoning with points and durations
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A new framework for reasoning about points, intervals and durations
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
A new proof of tractability for 0RD-horn relations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Categorical methods in qualitative reasoning: the case for weak representations
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
Case adaptation with qualitative algebras
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Automatic case acquisition from texts for process-oriented case-based reasoning
Information Systems
| Hi-index | 0.00 |
The significance of representing duration information along with the qualitative information of the time intervals is well argued in the literature. A new framework INVU (INterval and DUration) network consisting of 25 basic relations, is proposed here. INDU cam handle qualitative information of time interval and duration in one single structure. It inherits many interesting properties of Allen's Interval Algebra (of 13 basic relations) but it also exhibits severed interesting additional features. We present several representations of INDU (ORD-clause, Geometric and Lattice) and chatracterise its tractable subclasses such as the Convex and Pre-convex classes. The important contribution of the current study is to show that for the tractable subclasses (Convex as well as Pre-convex) 4-consistency is necessary to guarantee global consistency of INDU-network.