Abstract
LaTeR is a manager of temporal information which can be used in a loosely-coupled way by different types of applications. LaTeR is based on a layered architecture: at the physical layer heterogeneous (qualitative and quantitative) temporal information is amalgamated using a constraint framework and temporal reasoning is performed; the interface layer provides a high-level language for manipulating and querying temporal information. The expressive power of the language has been defined in such a way that complete temporal reasoning is tractable. Particular attention has been devoted to the design of the query language and to efficient query processing. Since in LaTeR temporal reasoning is performed during data manipulation (insertion and/or deletion of information), the complexity of answering a query depends only on the length of the query and not on the dimension of the knowledge base.
This work was partially supported by CNR, project “Ambienti e strumenti per la gestione di informazioni temporali”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26:832–843, 1983.
J. Allen. Time and time again: the many ways to represent time. Int. J. Intelligent Systems, 6(4):341–355, 1991.
V. Brusoni, L. Console, B. Pernici, and P. Terenziani. On the computational complexity of query answering in bounds on differences constraints. Technical report, Dip. di Informatica, Università di Torino, Torino, 1993.
E. Davis. Constraint propagation with interval labels. Artificial Intelligence, 32:281–331, 1987.
T. Dean and D. McDermott. Temporal data base management. Artificial Intelligence, 32:1–56, 1987.
R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.
H. Kautz and P. Ladkin. Integrating metric and qualitative temporal reasoning. In Proc. AAAI 91, pages 241–246, 1991.
R. Maiocchi, B. Pernici, and F. Barbic. Automatic deduction of temporal information. ACM Trans. on Database Systems, 17:647–688, 1992.
L. McKenzie and R. Snodgrass. Evaluation of relational algebras incorporating the time dimension in databases. ACM Computing Surveys, 23(4):501–543, 1991.
I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. In Proc. AAAI 91, pages 260–267, 1991.
R. Snodgrass, editor. Proc. of the Int. Work. on an infrastructure for Temporal Databases. 1993.
A. Tansell, R. Snodgrass, J. Clifford, S. Gadia, and A. Segev. Temporal Databases: Theory, design and implementation. Benjamin Cummings, 1993.
P. VanBeek. Temporal query processing with indefinite information. Artificial Intelligence in Medicine, 3:325–339, 1991.
M. Vilain. A system for reasoning about time. In Proc. AAAI 82, pages 197–201, 1982.
M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proc. AAAI 86, pages 377–382, 1986.
M. Vilain, H. Kautz, and P. VanBeek. Constraint propagation algorithms for temporal reasoning: a revised report. In D.S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about physical systems, pages 373–381. Morgan Kaufmann, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brusoni, V., Console, L., Pernici, B., Terenziani, P. (1994). LaTeR: a general purpose manager of temporal information. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive