By Topic

Efficient Algorithms for Fuzzy Qualitative Temporal Reasoning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Schockaert, S. ; Dept. of Appl. Math. & Comput. Sci., Ghent Univ., Ghent, Belgium ; De Cock, M.

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.

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:17 ,  Issue: 4 )