Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
A model and a language for the fuzzy representation and handling of time
Fuzzy Sets and Systems
Maintaining knowledge about temporal intervals
Communications of the ACM
Approximate Qualitative Temporal Reasoning
Annals of Mathematics and Artificial Intelligence
Spatial and Temporal Structures in Cognitive Processes
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Reasoning with Disjunctive Fuzzy Temporal Constraint Networks
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
Relations Between Fuzzy Time Intervals
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
The algebra IAfuz: a framework for qualitative fuzzy temporal reasoning
Artificial Intelligence
International Journal of Intelligent Systems
Qualitative temporal reasoning about vague events
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Question answering with imperfect temporal information
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Imprecise temporal interval relations
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Fuzzifying Allen's Temporal Interval Relations
IEEE Transactions on Fuzzy Systems
Hi-index | 0.00 |
Fuzzy qualitative temporal relations have been proposed to reason about events whose temporal boundaries are ill defined. Although the corresponding reasoning tasks are in the same complexity class as their crisp counterparts, in practice, the scalability of fuzzy temporal reasoners may be insufficient for applications that require a high expressivity and deal with a large number of events. On the other hand, transitivity rules can be used to make sound but incomplete inferences in polynomial time, utilizing a variant of Allen's path-consistency algorithm. The aim of this paper is to investigate how this polynomial time algorithm can be improved without altering its time complexity. To this end, we establish a characterization of 2-consistency of fuzzy temporal relations and provide transitivity rules that are significantly stronger than those resulting from straightforwardly generalizing transitivity rules for crisp temporal relations. We furthermore provide experimental evidence for the effectiveness of our improved algorithm.