Abstract
We are investigating interval-based temporal extensions of terminological logics. These extensions allow to model temporally rich domains with a terminological approach. The first part of the paper presents the extension of known terminological logics by adding temporal operators on intervals and providing a new semantics. Reasoning on taxonomies of time-dependent concepts defined with these logics involves computing a subsumption relation. We briefly describe what is known about un/decidability of subsumption and incomplete algorithms, but the emphasis of this paper is on a translation from these logics into a first order logic with two sorts. The temporal subsumption problem is reduced to validity for a subset of formulae. This translation formalizes the known relation between terminological and predicate logics, extending it to interval-based temporal operators. Through the translation we show that subsumptions are recursively enumerable for a class of these logics having as temporal domain the set of intervals defined as ordered pairs of rational numbers. We also show how ordinary theorem provers can be used as semi-automatic tools to prove temporal subsumption.
This work was partially supported by Italian MURST 60%, project: Multiversum della conoscenza.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, November 1983.
Claudio Bettini. Estensioni temporali dei linguaggi terminologici. PhD thesis, Dip. Scienze dell'Informazione — University of Milano, Italy, 1993. (in Italian).
Ronald J. Brachman and Hector J. Levesque. The tractability of subsumption in frame-based description languages. In Proc. of the American National Conference on Artificial Intelligence (AAAI-84), pages 34–37, Austin, TX, 1984.
H. B. Enderton. A mathematical introduction to logic. Academic Press, 1972.
Joseph Y. Halpern and Yoav Shoham. A propositional modal logic of time intervals. Journal of ACM, 38(4):935–962, 1991.
William W. McCune. OTTER 2.0 Users Guide. ARGONNE NATIONAL LABORATORY, 1990.
Klaus Schild. A correspondence theory for terminological logics. In Proc. of the 12 th International Joint Conference on Artificial Intelligence, Sidney, Australia, 1991.
Klaus Schild. A tense-logical extension of terminological logics. Technical Report KIT Report 92, Computer Science Department, Technische Universität Berlin, 1991.
Albrecht Schmiedel. A temporal terminological logic. In Proc. of the American National Conference on Artificial Intelligence (AAAI-90), pages 640–645, Boston, MA, 1990.
Y. Shoham. Reasoning about Change. The MIT Press, 1988.
P. van Beek and R. Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6, 1990.
Johan van Benthem. The logic of time. Dordrecht, 1983.
Johan van Benthem. Time, logic and computation. In linear/time, branching time and partial order in logics and models for concurrency, volume 354 of Lecture Notes in Computer Science, pages 1–49. Springer, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bettini, C. (1994). A formalization of interval-based temporal subsumption in first order logic. In: Lakemeyer, G., Nebel, B. (eds) Foundations of Knowledge Representation and Reasoning. Lecture Notes in Computer Science, vol 810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58107-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-58107-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58107-9
Online ISBN: 978-3-540-48453-0
eBook Packages: Springer Book Archive