|
|
|
                                          
|
Return to Regular Papers
An effort has been devoted in the recent years to study and formalize the concept of time granularity and to design applications and services using the formalization. Among other proposals, a calendar algebra has been defined to facilitate the specification of new granularities and to perform conversions among them. This paper shows how granularities defined as algebraic calendar expressions can be represented as periodical sets of instants. More precisely, the paper shows how each algebraic operator changes the periodical structure of the granularities given as operands. These results have an immediate application enabling users to easily specify new granularities and using them in the only constraint solver supporting time granularities that is currently available.
@inproceedings{DBLP:conf/time/BettiniMW04, author = {Claudio Bettini and Sergio Mascetti and Xiaoyang Sean Wang}, title = {Mapping Calendar Expressions into Periodical Granularities.}, booktitle = {TIME}, year = {2004}, pages = {96-102}, ee = {http://csdl.computer.org/comp/proceedings/time/2004/2155/00/21550096abs.htm}, crossref = {conf/time/2004}, bibsource = {DBLP, http://dblp.uni-trier.de} } @proceedings{DBLP:conf/time/2004, title = {11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 1-3 July 2004, Tatihou Island, Normandie, France}, booktitle = {TIME}, publisher = {IEEE Computer Society}, year = {2004}, isbn = {0-7695-2155-X}, bibsource = {DBLP, http://dblp.uni-trier.de} } },  ©2005 Association for Computing Machinery |
