{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:51:52Z","timestamp":1757569912873,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":84,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354058241X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0014006","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:34:32Z","timestamp":1132731272000},"page":"506-534","source":"Crossref","is-referenced-by-count":76,"title":["Temporal query languages: A survey"],"prefix":"10.1007","author":[{"given":"Jan","family":"Chomicki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"K.R. Apt, H.A. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89\u2013148. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"30_CR2","unstructured":"P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin\/Cummings, 1993."},{"issue":"11","key":"30_CR3","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"J.F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26(11):832\u2013843, November 1983.","journal-title":"Communications of the ACM"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3), September 1989.","DOI":"10.1016\/S0747-7171(89)80070-7"},{"key":"30_CR5","unstructured":"S. Abiteboul and V. Vianu. Expressive Power of Query Languages. In Theoretical Studies in Computer Science. Academic Press, 1992."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"M. Baudinet. Temporal Logic Programming is Complete and Expressive. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1989.","DOI":"10.1145\/75277.75301"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"M. Baudinet. On the Expressiveness of Temporal Logic Programming. Information and Computation, 1994. To appear.","DOI":"10.1006\/inco.1995.1036"},{"key":"30_CR8","unstructured":"M. Baudinet, J. Chomicki, and P. Wolper. Temporal Deductive Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 294\u2013320. Benjamin\/Cummings, 1993."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"M. Baudinet, J. Chomicki, and P. Wolper. Constraint-Generating Dependencies. In Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, May 1994.","DOI":"10.1007\/3-540-58601-6_102"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0169-023X(90)90020-E","volume":"5","author":"C. Beeri","year":"1990","unstructured":"C. Beeri. A formal approach to object-oriented databases. Data and Knowledge Engineering, 5:353\u2013382, 1990.","journal-title":"Data and Knowledge Engineering"},{"key":"30_CR11","unstructured":"A. Brodsky, J. Jaffar, and M.J. Maher. Towards Practical Constraint Databases. In International Conference on Very Large Data Bases, 1993."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"M. Baudinet, M. Ni\u00e9zette, and P. Wolper. On the Representation of Infinite Temporal Data and Queries. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991.","DOI":"10.1145\/113413.113439"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"J. Clifford and A. Croker. The Historical Relational Data Model (HRDM) and Algebra Based on Lifespans. In IEEE International Conference on Data Engineering, 1987.","DOI":"10.1109\/ICDE.1987.7272420"},{"key":"30_CR14","unstructured":"J. Clifford and A. Croker. The Historical Relational Data Model (HRDM) Revisited. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 6\u201327. Benjamin\/Cummings, 1993."},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/174638.174642","volume":"19","author":"J. Clifford","year":"1994","unstructured":"J. Clifford, A. Croker, and A. Tuzhilin. On Completeness of Historical Relational Query Languages. ACM Transactions on Database Systems, 19(1):64\u2013116, March 1994.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel. Computable Queries for Relational Databases. Journal of Computer and System Sciences, 21:156\u2013178, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A.K. Chandra","year":"1982","unstructured":"A.K. Chandra and D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99\u2013128, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"A.K Chandra. Theory of Database Queries. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 1\u20139, 1988.","DOI":"10.1145\/308386.308396"},{"key":"30_CR19","unstructured":"S. Chaudhuri. Temporal Relationships in Databases. In International Conference on Very Large Data Bases, 1988."},{"key":"30_CR20","volume-title":"PhD thesis","author":"J. Chomicki","year":"1990","unstructured":"J. Chomicki. Functional Deductive Databases: Query Processing in the Presence of Limited Function Symbols. PhD thesis, Rutgers University, New Brunswick, New Jersey, January 1990. Also Laboratory for Computer Science Research Technical Report LCSR-TR-142."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"J. Chomicki. Polynomial-Time Computable Queries in Temporal Deductive Databases. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, Tennessee, April 1990.","DOI":"10.1145\/298514.298589"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"J. Chomicki. History-less Checking of Dynamic Integrity Constraints. In IEEE International Conference on Data Engineering, Phoenix, Arizona, February 1992.","DOI":"10.1109\/ICDE.1992.213153"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"J. Chomicki and T. Imieli\u0144ski. Temporal Deductive Databases and Infinite Objects. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, Texas, March 1988.","DOI":"10.1145\/308386.308416"},{"issue":"2","key":"30_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/151634.151635","volume":"18","author":"J. Chomicki","year":"1993","unstructured":"J. Chomicki and T. Imieli\u0144ski. Finite Representation of Infinite Query Answers. ACM Transactions on Database Systems, 18(2):181\u2013223, June 1993.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"J. Clifford and T. Isakowitz. On the Semantics of (Bi) Temporal Variable Databases. In International Conference on Extending Database Technology, Cambridge, UK, March 1994.","DOI":"10.1007\/3-540-57818-8_53"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"J. Clifford and A.U. Tansel. On an Algebra for Historical Relational Databases: Two Views. In ACM SIGMOD International Conference on Management of Data, 1985.","DOI":"10.1145\/318898.318922"},{"issue":"2","key":"30_CR27","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/319983.319986","volume":"8","author":"J. Clifford","year":"1983","unstructured":"J. Clifford and D.S. Warren. Formal Semantics for Time in Databases. ACM Transactions on Database Systems, 8(2):214\u2013254, June 1983.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"key":"30_CR29","unstructured":"C. E. Dyreson and R.T. Snodgrass. Historical Indeterminacy. In IEEE International Conference on Data Engineering, 1993."},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"C.E. Dyreson, M.D. Soo, and R.T. Snodgrass. The TSQL2 Data Model for Time. A TSQL2 Commentary, March 1994.","DOI":"10.1007\/978-1-4615-2289-8_6"},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"E.A. Emerson. Temporal and Modal Logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995\u20131072. Elsevier\/MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"30_CR32","unstructured":"H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972."},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"M. Finger. Handling Database Updates in Two-Dimensional Temporal Logic. Journal of Applied Non-Classical Logic, 1992.","DOI":"10.1080\/11663081.1992.10510782"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"D. Gabbay. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, B. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398, pages 409\u2013448. Springer-Verlag, LNCS 398, 1989.","DOI":"10.1007\/3-540-51803-7_36"},{"issue":"4","key":"30_CR35","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/49346.50065","volume":"13","author":"S.K. Gadia","year":"1988","unstructured":"S.K. Gadia. A Homogenous Relational Model and Query Languages for Temporal Databases. ACM Transactions on Database Systems, 13(4)418\u2013448, December 1988.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR36","unstructured":"S.K. Gadia. Temporal Databases: A Prelude to Parametric Data. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 28\u201366. Benjamin\/Cummings, 1993."},{"key":"30_CR37","unstructured":"D. Gabbay and P. McBrien. Temporal Logic and Historical Databases. In International Conference on Very Large Data Bases, 1991."},{"key":"30_CR38","doi-asserted-by":"crossref","unstructured":"D. Gabbay, A. Pnueli, S. Shelah, and S. Stavi. On the Temporal Analysis of Fairness. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1980.","DOI":"10.1145\/567446.567462"},{"key":"30_CR39","doi-asserted-by":"crossref","unstructured":"G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer-Verlag, LNCS 554, 1991.","DOI":"10.1007\/3-540-54919-6"},{"issue":"4","key":"30_CR40","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"J.Y. Halpern","year":"1991","unstructured":"J.Y. Halpern and Y. Shoham. A Propositional Modal Logic of Time Intervals. Journal of the ACM, 38(4):935\u2013962, October 1991.","journal-title":"Journal of the ACM"},{"issue":"4","key":"30_CR41","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski and W. Lipski. Incomplete Information in Relational Databases. Journal of the ACM, 31(4):761\u2013791, 1984.","journal-title":"Journal of the ACM"},{"key":"30_CR42","unstructured":"C.S. Jensen and L. Mark. Differential Query Processing in Transaction-Time Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 457\u2013496. Benjamin\/Cuminings, 1993."},{"key":"30_CR43","doi-asserted-by":"crossref","unstructured":"C.S. Jensen and R.T. Snodgrass. Temporal Specialization. In IEEE International Conference on Data Engineering, pages 594\u2013603, 1992.","DOI":"10.1109\/ICDE.1992.213149"},{"key":"30_CR44","doi-asserted-by":"crossref","unstructured":"C.S. Jensen, M.D. Soo, and R.T. Snodgrass. Unification of Temporal Data Models. In IEEE International Conference on Data Engineering, 1993.","DOI":"10.1109\/ICDE.1993.344056"},{"key":"30_CR45","volume-title":"PhD thesis","author":"J.A.W. Kamp","year":"1968","unstructured":"J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968."},{"key":"30_CR46","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1111\/j.1755-2567.1971.tb00071.x","volume":"37","author":"H. Kamp","year":"1971","unstructured":"H. Kamp. Formal properties of\u2019 now'. Theoria, 37:227\u2013273, 1971.","journal-title":"Theoria"},{"key":"30_CR47","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint Query Languages. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 299\u2013313, Nashville, Tennessee, April 1990. To appear in Journal of Computer and System Sciences.","DOI":"10.1145\/298514.298582"},{"key":"30_CR48","unstructured":"H. Kautz and P. Ladkin. Integrating Metric and Qualitative Temporal Reasoning. In National Conference on Artificial Intelligence, 1991."},{"key":"30_CR49","unstructured":"M. Koubarakis. The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Manuscript."},{"key":"30_CR50","doi-asserted-by":"crossref","unstructured":"M. Koubarakis. Representation and Querying in Temporal Databases: the Power of Temporal Constraints. In IEEE International Conference on Data Engineering, 1993.","DOI":"10.1109\/ICDE.1993.344049"},{"key":"30_CR51","doi-asserted-by":"crossref","unstructured":"M. Koubarakis. Foundations of Indefinite Constraint Databases. In Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, May 1994.","DOI":"10.1007\/3-540-58601-6_106"},{"key":"30_CR52","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0022-0000(91)90033-2","volume":"43","author":"P.G. Kolaitis","year":"1991","unstructured":"P.G. Kolaitis and C.H. Papadimitriou. Why not Negation by Fixpoint? Journal of Computer and System Sciences, 43:125\u2013144, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR53","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, and J.S. Vitter. Indexing for Data Models with Constraints and Classes. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993.","DOI":"10.1145\/153850.153884"},{"key":"30_CR54","doi-asserted-by":"crossref","unstructured":"F. Kabanza, J-M. Stevenne, and P. Wolper. Handling Infinite Temporal Data. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 392\u2013403, Nashville, Tennessee, April 1990.","DOI":"10.1145\/298514.298590"},{"key":"30_CR55","unstructured":"T.Y. Cliff Leung and R.R. Muntz. Stream Processing: Temporal Query Processing and Optimization. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 329\u2013355. Benjamin\/Cummings, 1993."},{"issue":"3","key":"30_CR56","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0306-4379(87)90004-4","volume":"12","author":"U.W. Lipeck","year":"1987","unstructured":"U.W. Lipeck and G. Saake. Monitoring Dynamic Integrity Constraints Based on Temporal Logic. Information Systems, 12(3):255\u2013269, 1987.","journal-title":"Information Systems"},{"key":"30_CR57","unstructured":"I. Meiri. Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In National Conference on Artificial Intelligence, 1991."},{"key":"30_CR58","unstructured":"A. Montanari and B. Pernici. Temporal Reasoning. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 534\u2013562. Benjamin\/Cummings, 1993."},{"key":"30_CR59","unstructured":"A. Montanari and B. Pernici. Towards a Temporal Logic Reconstruction of Temporal Databases. In Proc. International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas, June 1993."},{"issue":"4","key":"30_CR60","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/125137.125166","volume":"23","author":"L.E. McKenzie Jr.","year":"1991","unstructured":"L.E. Jr. McKenzie and R.T. Snodgrass. Evaluation of Relational Algebras Incorporating the Time Dimension in Databases. ACM Computing Surveys, 23(4):501\u2013543, December 1991.","journal-title":"ACM Computing Surveys"},{"key":"30_CR61","unstructured":"M.A. Orgun. A Temporal Algebra Based on an Abstract Model. In M.E. Orlowska and M. Papazoglou, editors, Advances in Database Research: Proceedings of the 4th Australian Database Conference, pages 301\u2013316. World Scientific, 1993."},{"key":"30_CR62","doi-asserted-by":"crossref","unstructured":"T. C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193\u2013216. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"30_CR63","doi-asserted-by":"crossref","unstructured":"P.Z. Revesz. A Closed Form for Datalog Queries with Integer Order. In International Conference on Database Theory, pages 187\u2013201. Springer-Verlag, LNCS 470, 1990. To appear in Theoretical Computer Science.","DOI":"10.1007\/3-540-53507-1_77"},{"key":"30_CR64","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(93)90222-F","volume":"116","author":"P.Z. Revesz","year":"1993","unstructured":"P.Z. Revesz. A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theoretical Computer Science, 116:117\u2013149, 1993.","journal-title":"Theoretical Computer Science"},{"key":"30_CR65","doi-asserted-by":"crossref","unstructured":"R. Snodgrass and I. Ahn. Temporal Databases. IEEE Computer, 19(9), 1986.","DOI":"10.1109\/MC.1986.1663327"},{"key":"30_CR66","unstructured":"A. Segev. Join Processing and Optimization in Temporal Relational Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 356\u2013387. Benjamin\/Cummings, 1993."},{"issue":"2","key":"30_CR67","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1145\/22952.22956","volume":"12","author":"R. Snodgrass","year":"1987","unstructured":"R. Snodgrass. The Temporal Query Language TQuel. ACM Transactions on Database Systems, 12(2):247\u2013298, June 1987.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR68","doi-asserted-by":"crossref","unstructured":"R.T. Snodgrass. Temporal Databases. In A.U. Frank, I. Campari, and U. Formentini, editors, Theories and Methods of Spatio-Temporal Reasoning in Geographic Space, pages 22\u201364. Springer-Verlag, LNCS 639, 1992.","DOI":"10.1007\/3-540-55966-3_2"},{"key":"30_CR69","doi-asserted-by":"crossref","unstructured":"A.P. Sistla and O. Wolfson. Temporal Triggers in Active Databases. IEEE Transactions on Knowledge and Data Engineering, 1994. To appear.","DOI":"10.1109\/69.390251"},{"key":"30_CR70","unstructured":"A. Tuzhilin and J. Clifford. A Temporal Relational Algebra as a Basis for Temporal Relational Completeness. In International Conference on Very Large Data Bases, 1990."},{"key":"30_CR71","unstructured":"A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Benjamin\/Cummings, 1993."},{"key":"30_CR72","unstructured":"D. Toman, J. Chomicki, and D.S. Rogers. Datalog with Integer Periodicity Constraints. Technical Report TR-CS-94-1, Computing and Information Sciences, Kansas State University, 1994. Submitted for publication."},{"issue":"3","key":"30_CR73","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(81)90663-X","volume":"48","author":"W. Thomas","year":"1981","unstructured":"W. Thomas. A Combinatorial Approach to the Theory of \u03c9-automata. Information and Control, 48(3):261\u2013283, 1981.","journal-title":"Information and Control"},{"key":"30_CR74","unstructured":"J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988."},{"key":"30_CR75","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi. The Complexity of Relational Query Languages. In ACM SIGACT Symposium on Theory of Computing, pages 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"},{"key":"30_CR76","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. A Temporal Fixpoint Calculus. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1988.","DOI":"10.1145\/73560.73582"},{"key":"30_CR77","doi-asserted-by":"crossref","unstructured":"J.F.A.K. van Benthem. The Logic of Time. D.Reidel, 2nd edition, 1991.","DOI":"10.1007\/978-94-015-7947-6"},{"key":"30_CR78","doi-asserted-by":"crossref","unstructured":"R. van der Meyden. The Complexity of Querying Indefinite Data about Linearly Ordered Domains. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992.","DOI":"10.1145\/137097.137902"},{"issue":"4","key":"30_CR79","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"},{"issue":"4","key":"30_CR80","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1305\/ndjfl\/1093635589","volume":"31","author":"Y. Venema","year":"1990","unstructured":"Y. Venema. Expressiveness and Completeness of an Interval Tense Logic. Notre Dame Journal of Formal Logic, 31(4):529\u2013547, 1990.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"2","key":"30_CR81","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/114325.103712","volume":"16","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder and R.W. Topor. Safety and Translation of Relational Calculus Queries. ACM Transactions on Database Systems, 16(2):235\u2013278, June 1991.","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR82","unstructured":"M. Vilain and H. Kautz. Constraint Propagation Algorithms for Temporal Reasoning. In National Conference on Artificial Intelligence, 1986."},{"key":"30_CR83","doi-asserted-by":"crossref","unstructured":"X.S. Wang, S. Jajodia, and V.S. Subrahmanian. Temporal Modules: An Approach Toward Federated Temporal Databases. In ACM SIGMOD International Conference on Management of Data, pages 227\u2013236, 1993.","DOI":"10.1145\/170035.170074"},{"key":"30_CR84","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"P. Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56:72\u201399, 1983.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Temporal Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0014006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T21:39:12Z","timestamp":1736113152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354058241X"],"references-count":84,"URL":"https:\/\/doi.org\/10.1007\/bfb0014006","relation":{},"subject":[]}}