Formalizing Calendars with the Category of Ordinals

Authors:
Sylviane R. Schwer
Affiliations:
L.I.P.N. UPRESA CNRS 7030, Institut Galilée, Université Paris 13, 99, Bd J-B Clément, Fr. 93430 Villetaneuse. schwer@lipn.univ-paris13.fr
Venue:
Applied Intelligence
Year:
2002

Citing 5
Cited 1

Temporal modules: an approach toward federated temporal databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
TSQL2 language specification

ACM SIGMOD Record
Calendrical calculations

Calendrical calculations
A general framework for time granularity and its application to temporal reasoning

Annals of Mathematics and Artificial Intelligence
Implementing Calendars and Temporal Rules in Next Generation Databases

Proceedings of the Tenth International Conference on Data Engineering

A rough set-based association rule approach implemented on exploring beverages product spectrum

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Starting from the basic notion of chronology, we provide a natural representation of calendars and appropriate tools for manipulating them, inside the framework of finite ordinals category. We show that calendars are closed under infimum and supremum operations but not under direct limits.