Abstract
Temporal logic queries on Datalog and negated Datalog programs are studied, and their relationship to Datalog queries on these programs is explored. It is shown that, in general, temporal logic queries have more expressive power than Datalog queries on Datalog and negated Datalog programs. It is also shown that anexistential domain-independent fragment of temporal logic queries has the same expressive power as Datalog queries on negated Datalog programs with inflationary semantics. This means that for finite structures this class of queries has the power of the fixpoint logic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. J. Comput. Syst. Sci.43, 62–124 (1991)
Baudinet, M., Chomicki, J., Wolper, P.: Temporal deductive databases. In: Tansel, A., Clifford, J., Gadia, S., Jajodia, S., Segev, A., Snodgrass, R. (eds.) Temporal databases. Menlo Park: Benjamin/Cummings 1993
Baudinet, M., Niezette, M., Wolper, P.: On the representation of infinite temporal data and queries. In Proceedings of PODS Symposium, pp. 280–290, 1991
Clifford, J., Croker, A., Tuzhilin, A.: On completeness of historical query languages. TODS (to appear)
Emerson, E.A.: Temporal and modal logic. In: Handbook of theoretical computer science, Chap. 16, pp. 996–1072. Amsterdam: Elsevier 1990
Gabbay, D., McBrien, P.: Temporal logic and historical databases. In: International Conference on Very Large Databases, 1991
Gurevich, Y., Shelah, S.: Fixed-point extensins of first-order logic. Ann. Pure Appl. Logic.32, 265–280 (1986)
Kolaitis, P.G., Papadimitriou, C.H.: Why not negation by fixpoint? Comput. Syst. Sci.43, 125–144 (1991)
Kröger, F.: Temporal logic of programs. (EATCS Monographs on Theoretical Computer Science, vol. 8) Berlin, Heidelberg, New York: Springer 1987
Kedem, Z.M., Tuzhilin, A.: Relational database behavior: Utilizing relational discrete event systems and models. In: Proceedings of PODS Symposium, pp. 336–346, 1989
Moschovakis, Y.: Elementary induction on abstract structures. Amsterdam: North-Holland 1974
Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems. Berlin, Heidelberg, New York: Springer 1992
Tuzhilin, A., Clifford, J.: A temporal relational algebra as a basis for temporal relational completeness. In: International Conference on Very Large Databases, pp. 13–23, 1990
Tuzhilin, A., Kedem, Z.M.: Using temporal logic and datalog to query databases evolving in time. Technical Report 484, New York University, 1989
Tuzhilin, A., Kedem, Z.M.: Modeling dynamics of databases with relational discrete event systems and models. Working Paper IS-91-5, Stern School of Business, NYU, 1991
Tuzhilin, A.: Applications of temporal databases to knowledge-based simulations. In: Tansel, A., Clifford, J., Gadia, S., Jajodia, S., Segev, A., Snodgrass, R. (eds.) Temporal databases. Menlo Park: Benjamin Cummings 1993
Ullman, J.: Principles of database and knowledge-base systems, vol. 1, Potomac, MD: Computer Science Press 1988
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tuzhilin, A. Querying datalog programs with temporal logic. Acta Informatica 30, 679–700 (1993). https://doi.org/10.1007/BF01191723
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01191723