A Constraint-based Modeling of Calendars

Temporal information in the real world is often presented in an incomplete fashion. In this paper we propose a constraint-based calendar system suitable for inferring implicit calendric information. Our approach views calendars as constraint satisfaction problems, and time points are represented as instantiations of temporal units. We also present a semantic model for the system to justify the imposed design requirements, and describe selected services provided by such systems.

[1]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[2]  Donna Gates,et al.  From Language to Time: A Temporal Expression Anchorer , 2006, Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06).

[3]  Sushil Jajodia,et al.  An Algebraic Representation of Calendars , 2004, Annals of Mathematics and Artificial Intelligence.

[4]  Claudio Bettini,et al.  Symbolic representation of user-defined time granularities , 1999, Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99.

[5]  Massimo Franceschet,et al.  Representing and Reasoning about Temporal Granularities , 2004, J. Log. Comput..

[6]  Dov M. Gabbay,et al.  Calendar Logic , 1998, J. Appl. Non Class. Logics.

[7]  Jef Wijsen.  A String-based Model for Infinite Granularities ( Extended Abstract ) , 1999 .

[8]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.