Abstract
A specification language is presented for describing every day temporal notions, like weekends, holidays, office hours etc. The time model underlying this language exploits in a particular way the well investigated algorithms for calendar systems currently in use. All peculiarities and irregularities of the calendar systems, like time zones, leap years, daylight savings time are respected. The specification language and the underlying temporal model allows us to convert between arbitrary calendar systems and to decide a number of questions, for example whether a certain point in time is within the time intervals specified by a term in this language. Besides neglecting the phenomena of relativity theory, there are no idealizing assumptions. The language is the basis for a temporal logic with quantifiers over real time temporal notions.
This work was supported by EPSRC Research Grant GR/K57282.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dershowitz, N. and E. M. Reingold: 1997, Calendrical Calculations. Cambridge University Press.
Ohlbach, H. J. and D. Gabbay: 1997, ‘Calendar logic’. Technical report, Imperial Colleg.
Schmidt-Schauß, M.: 1989, ‘Computational Aspects of an Order-Sorted Logic with Term Declarations’. Vol. 395 of Lecture Notes in Artificial Intelligence. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ohlbach, H.J. (2000). About Real Time, Calendar Systems and Temporal Notions. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds) Advances in Temporal Logic. Applied Logic Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9586-5_16
Download citation
DOI: https://doi.org/10.1007/978-94-015-9586-5_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5389-3
Online ISBN: 978-94-015-9586-5
eBook Packages: Springer Book Archive