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.

An Efficient Algorithm for Minimizing Time Granularity Periodical Representations / C. Bettini, S. Mascetti - In: 12th International Symposium on Temporal Representation and Reasoning (Time 2005) [electronic resource] : proceedings : 23-25 June, 2005, Burlington, Vermont / sponsored by University of Vermont, University of Buffalo, University of Waterloo. - Los Alamitos : IEEE Computer Society, 2005. - ISBN 0769523706. - pp. 20-25 (( Intervento presentato al 12. convegno International Symposium on Temporal Representation and Reasoning - TIME 2005 tenutosi a Burlinghton, VE nel 2005.

An Efficient Algorithm for Minimizing Time Granularity Periodical Representations

C. Bettini
Primo
;
S. Mascetti
Ultimo
2005

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.
Settore INF/01 - Informatica
Book Part (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/8285
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
social impact