Abstract
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic \( \mathcal{D}\mathcal{L}\mathcal{R} \)and point-based linear temporal logic with Since and Until.We define a query language (where queries are non-recursive Datalog programs and atoms are complex \( \mathcal{D}\mathcal{L}\mathcal{R}_{\mathcal{U}\mathcal{S}} \) expressions) and investigate the problem of checking query containment under the constraints defined by \( \mathcal{D}\mathcal{L}\mathcal{R}_{\mathcal{U}\mathcal{S}} \) conceptual schemas—i.e., \( \mathcal{D}\mathcal{L}\mathcal{R}_{\mathcal{U}\mathcal{S}} \) knowledge bases—as well as the problems of schema satisfiability and logical implication.
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
S. Abiteboul, L. Herr, and J. Van den Bussche. Temporal versus first-order logic to query temporal databases. In Proc. of the 15th ACMSIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS’96), pages 49–57, 1996.
A. Artale and E. Franconi. Reasoning with enhanced temporal entity-relationship models. In Proc. of the InternationalWorkshop on Spatio-Temporal Data Models and Languages. IEEE Computer Society Press, August 1999.
A. Artale and E. Franconi. Temporal ER modeling with description logics. In Proc. ofthe International Conference on Conceptual Modeling (ER’99). Springer-Verlag, November 1999.
A. Artale and E. Franconi. A survey of temporal extensions of description logics. Annals of Mathematics and Artificial Intelligence, 30(1–4), 2001.
F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2002.
A. Borgida and R. J. Brachman. Conceptual modelling with description logics. In Baader et al. [5].
A. Borgida, M. Lenzerini, and R. Rosati. Description logics for databases. In Baader et al. [5].
A. Calì D. Calvanese, G. De Giacomo, and M. Lenzerini. A formal framework for reasoning on UML class diagrams. In Proc. of the 13th Int. Sym. on Methodologies for Intelligent Systems (ISMIS 2002), 2002.
D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGACT SIGMOD SIGART Sym. on Principles of Database Systems (PODS’98), pages 149–158, 1998.
D. Calvanese, M. Lenzerini, and D. Nardi. Description logics for conceptual data modeling. In Chomicki and Saake [13].
D. Calvanese, M. Lenzerini, and D. Nardi. Unifying class-based representation formalisms. J. of Artificial Intelligence Research, 11:199–240, 1999.
J. Chomicki. Temporal query languages: a survey. In Proc. of the 1st International Conference on Temporal Logic (ICTL’94), pages 506–534, 1994.
J. Chomicki and G. Saake, editors. Logics for Databases and Information Systems. Kluwer, 1998.
J. Chomicki and D. Toman. Temporal logic in information systems. In Chomicki and Saake [13], chapter 1.
E. Franconi, F. Grandi, and F. Mandreoli. A semantic approach for schema evolution and versioning in object-oriented databases. In Proc. of the 1st International Conf. on Computational Logic (CL’2000), DOOD stream. Springer-Verlag, July 2000.
E. Franconi and G. Ng. The ICOM tool for intelligent conceptual modelling. In Proc. of the 7th International Workshop on Knowledge Representation meets Databases (KRDB’2000), 2000.
D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-dimensional modal logics: theory and applications. Studies in Logic. Elsevier, 2002. To appear.
H Gregersen and J. S. Jensen. Temporal Entity-Relationship models-a survey. IEEE Transactions on Knowledge and Data Engineering, 11(3):464–497, 1999.
I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85–134, 2000.
M. Jarke, C. Quix, D. Calvanese, M. Lenzerini, E. Franconi, S. Ligoudistiano, P. Vassiliadis, and Y. Vassiliou. Concept based design of data warehouses: The DWQ demonstrators. In 2000 ACM SIGMOD Intl. Conference on Management of Data, 2000.
K. Schild. Combining terminological logics with tense logic. In Proceedings of the 6th Portuguese Conference on Artificial Intelligence, EPIA’93, October 1993.
S. Spaccapietra, C. Parent, and E. Zimanyi. Modeling time from a conceptual perspective. In Int. Conf. on Information and Knowledge Management (CIKM98), 1998.
H. Sturm and F. Wolter. A tableau calculus for temporal description logic: the expanding domain case. Journal of Logic and Computation, 2002. To appear.
P. van Emde Boas. The convenience of tiling. Technical Report CT-96-01, ILLC—Univ. ofAmsterdam, 1996.
F. Wolter and M. Zakharyaschev. Satisfiability problem in description logics with modal operators. In Proc. of the 6 th International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 512–523, Trento, Italy, June 1998.
F. Wolter and M. Zakharyaschev. Modal description logics: Modalizing roles. Fundamenta Informaticae, 39(4):411–438, 1999.
F. Wolter and M. Zakharyaschev. Multi-dimensional description logics. In Proc. of IJCAI’99, pages 104–109, 1999.
F. Wolter and M. Zakharyaschev. Temporalizing description logics. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems, pages 379–401. Studies Press-Wiley, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Artale, A., Franconi, E., Wolter, F., Zakharyaschev, M. (2002). A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive