Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
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
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
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
Temporal Constraints: A Survey
Constraints
On point-duration networks for temporal reasoning
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
Some Observations on Durations, Scheduling and Allen's Algebra
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Computing context-dependent temporal diagnosis in complex domains
Expert Systems with Applications: An International Journal
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts
Journal of Artificial Intelligence Research
A new framework for reasoning about points, intervals and durations
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Grading knowledge: extracting degree information from texts
Grading knowledge: extracting degree information from texts
Hi-index | 0.00 |
We present here a qualitative temporal reasoning system that takes both points and durations as primitive objects and allows relative and indefinite information. We formaly define a point duration network, as a structure formed by two point algebra (PA) networks separately but not independently, since ternary constraints are introduced for relating point and duration information. We adapt some of the concepts and reasoning techniques developed for the point algebra networks, such as consistency and minimality. We prove that the problem of determining consistency in a point duration network is NP-complete. A simpler and polynomial-time decision problem is introduced for a restricted kind of point duration networks. Finally we suggest how to determine consistency and find minimal point duration network in the general case.