An Efficient Algorithm for Minimizing Time Granularity Periodical Representations

Authors:
Claudio Bettini;Sergio Mascetti
Affiliations:
University of Milan;University of Milan
Venue:
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Year:
2005

Citing 0
Cited 3

Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets

Journal of Artificial Intelligence Research
On the efficient construction of multislices from recurrences

SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Querying multi-granular compact representations

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the technical problem of efficiently reducing the periodic representation of a time granularity to its minimal form. The minimization algorithm presented in the paper has an immediate practical application: it allows users to intuitively define granularities (and more generally, recurring events) with algebraic expressions that are then internally translated to mathematical characterizations in terms of minimal periodic sets. Minimality plays a crucial role, since the value of the recurring period has been shown to dominate the complexity when processing periodic sets.