Graphs and algorithms
Artificial Intelligence
Constraint propagation with interval labels
Artificial Intelligence
Using temporal hierarchies to efficiently maintain large temporal databases
Journal of the ACM (JACM)
Artificial Intelligence - Special issue on knowledge representation
A general temporal model supporting duration reasoning
AI Communications
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM SIGART Bulletin
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
On point-duration networks for temporal reasoning
Artificial Intelligence
Temporal Representation and Reasoning for Dynamic Environments
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
INDU: An Interval and Duration Network
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
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
Hi-index | 0.00 |
Constraint-based formalisms are a useful and common way to deal with temporal reasoning tasks. Assertions represent temporal constraints between temporal objects, time-points or intervals: Metric temporal constraints between time points permit us to express a minimum and maximum temporal distance between two time points and to define a valid temporal interval for each one. However, existing approaches have limited expressiveness for representing non-disjunctive qualitative constraints of point algebra and the empirical results do not seem very adequate for managing a great number of time points or when the time for management is limited.In this paper, an efficient and expressive time point and duration-based temporal representation model with metric constraints is presented. The main features of the model refer to the formal properties of the internal time model and the specific representation of temporal constraints, which integrates constraints on time-points and on durations and is more adequate for their computational management. Sound and complete management processes are specified on the basis of model properties. From this specification, two choices for management are proposed: (i) with neither propagation nor preprocessing techniques, complete management algorithms have an O(e*n) complexity, but a linear empirical cost is obtained; (ii) with complete propagation an O(n2) complexity is achieved.