{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T19:25:31Z","timestamp":1597173931901},"publisher-location":"Berlin\/Heidelberg","reference-count":105,"publisher":"Springer-Verlag","isbn-type":[{"value":"354058241X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0014004","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:34:32Z","timestamp":1132731272000},"page":"445-479","source":"Crossref","is-referenced-by-count":36,"title":["An overview of temporal and modal logic programming"],"prefix":"10.1007","author":[{"given":"Mehmet A.","family":"Orgun","sequence":"first","affiliation":[]},{"given":"Wanli","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(89)90138-2","volume":"65","author":"M. Abadi","year":"1989","unstructured":"M. Abadi. The power of temporal proofs. Theoretical Computer Science, 65(1989):35\u201383, 1989.","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","unstructured":"M. Abadi and Z. Manna. Nonclausal temporal deduction. In R. Parikh, editor, Proc. of Conference on Logics of Programs, volume 193 of LNCS, pages 1\u201315. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15648-8_1","doi-asserted-by":"crossref"},{"key":"28_CR3","author":"M. Abadi","first-page":"4","year":"1987","unstructured":"M. Abadi and Z. Manna. Temporal logic programming. In Proceedings of the 1987 Symposium on Logic Programming, pages 4\u201316, San Fransisco, Calif, 1987. IEEE Computer Society Press.","volume-title":"Temporal logic programming"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0747-7171(89)80070-7","volume":"8","author":"M. Abadi","year":"1989","unstructured":"M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, 8:277\u2013295, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR5","author":"H. Ait-Kaci","year":"1990","unstructured":"Hassan Ait-Kaci. The WAM: A (Real) Tutorial. Paris Research Laboratory, Digital Equipment Corporation, Paris, France, 1990.","volume-title":"The WAM: A (Real) Tutorial"},{"key":"28_CR6","author":"S. Akama","first-page":"99","year":"1986","unstructured":"Seiki Akama. A proposal of modal logic programming (extended abstract). In Proc. of the 6th Canadian Conference on Artificial Intelligence, pages 99\u2013102, \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec, Canada, May 1986. Presses de l'Universit\u00e9 du Qu\u00e9bec.","volume-title":"A proposal of modal logic programming (extended abstract)"},{"key":"28_CR7","unstructured":"Seiki Akama. A meta-logical foundation of modal logic programming. 1-20-1, Higashi-Yurigaoka, Asao-ku, Kawasaki-shi, 215, Japan, December 1989."},{"key":"28_CR8","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:832\u2013843, November 1983.","journal-title":"Communications of the ACM"},{"key":"28_CR9","unstructured":"T. Aoyagi, M. Fujita, and T. Moto-oka. Temporal logic programming language Tokio. In E. Wada, editor, Logic Programming'85, volume 221 of LNCS, pages 138\u2013147. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16479-0_14","doi-asserted-by":"crossref"},{"key":"28_CR10","unstructured":"E. A. Ashcroft, A. A. Faustini, and B. Huey. Eduction: A model of parallel computation and the programming language Lucid. In Proc. of Phoenix Conference on Computers and Communications, pages 9\u201315. IEEE Computer Society Press, 1985."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0205029","volume":"5","author":"E. A. Ashcroft","year":"1976","unstructured":"E. A. Ashcroft and W. W. Wadge. Lucid \u2014 a formal system for writing and proving programs. SIAM Journal on Computing, 5:336\u201354, September 1976.","journal-title":"SIAM Journal on Computing"},{"key":"28_CR12","unstructured":"Y. Aufray and P. Enjalbert. Modal theorem proving: an equational viewpoint. To appear in Journal of Logic and Computation, 1992.","DOI":"10.1093\/logcom\/2.3.247","doi-asserted-by":"crossref"},{"key":"28_CR13","unstructured":"Philippe Balbiani, Luis Fari\u00f1as del Cerro, and Andreas Herzig. Declarative semantics for modal logic programs. In Proceedings of the 1988 International Conference on Fifth Generation Computer Systems, pages 507\u2013514. ICOT, 1988."},{"key":"28_CR14","unstructured":"Philippe Balbiani, Andreas Herzig, and Mamede Lima-Marques. TIM: The Toulouse inference machine for non-classical logic programming. In PDK'91: International Workshop on Processing Declarative Knowledge, volume 567 of LNAI, pages 365\u2013382. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0013544","doi-asserted-by":"crossref"},{"key":"28_CR15","unstructured":"Philippe Balbiani, Andreas Herzig, and Mamede Lima-Marques. Implementing Prolog extensions: a parallel inference machine. In Proc. of the 1992 International Conference on Fifth Generation Computer Systems, pages 833\u2013842. ICOT, 1992."},{"key":"28_CR16","author":"M. Baudinet","year":"1988","unstructured":"M. Baudinet. On the semantics of temporal logic programming. Technical Report STAN-CS-88-1203, Computer Science Department, Stanford University, Stanford, Calif, June 1988.","volume-title":"Technical Report STAN-CS-88-1203"},{"key":"28_CR17","author":"M. Baudinet","first-page":"267","year":"1989","unstructured":"M. Baudinet. Temporal logic programming is complete and expressive. In Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, pages 267\u2013280, Austin, Texas, January 1989. The Association for Computing Machinery.","volume-title":"Temporal logic programming is complete and expressive"},{"key":"28_CR18","unstructured":"M. Baudinet. A simple proof of the completeness of temporal logic programming. In L. Fari\u00f1as del Cerro and M. Penttonen, editors, Intensional Logics for Programming, pages 51\u201383. Oxford University Press, 1992."},{"key":"28_CR19","author":"M. Baudinet","year":"1993","unstructured":"M. Baudinet, J. Chomicki, and P. Wolper. Temporal deductive databases. In A. Tansel and et al, editors, Temporal Databases: Theory, Design, and Implementation. Benjamin\/Cummings Publishing Company, Redwood City, CA, 1993.","volume-title":"Temporal Databases: Theory, Design, and Implementation"},{"issue":"1&2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(92)90045-5","volume":"14","author":"M. Baudinet","year":"1992","unstructured":"Marianne Baudinet. Proving termination properties of Prolog programs: a semantic approach. Journal of Logic Programming, 14(1 & 2):1\u201330, October 1992.","journal-title":"Journal of Logic Programming"},{"key":"28_CR21","unstructured":"Pierre Bieber, Luis Fari\u00f1as del Cerro, and Andreas Herzig. MOLOG: A Modal Prolog. In E. Lusk and R. Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction, pages 762\u2013763. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0012886","doi-asserted-by":"crossref"},{"key":"28_CR22","unstructured":"H. A. Blair, A. L. Brown, and V. S. Subrahmanian. Monotone logic programming. In L. Fari\u00f1as del Cerro and M. Penttonen, editors, Intensional Logics for Programming, pages 1\u201322. Oxford University Press, 1992."},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"H. A. Blair","year":"1989","unstructured":"H. A. Blair and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68:135\u2013154, 1989.","journal-title":"Theoretical Computer Science"},{"key":"28_CR24","unstructured":"H.A. Blair et al. A logic programming semantics scheme, Part I. Technical Report LPRG-TR-88-8, Logic Programming Research Group, Syracuse University, 1988."},{"key":"28_CR25","unstructured":"Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 661\u2013677, San Diego, Calif, October 28\u201331 1991."},{"key":"28_CR26","author":"C. Brzoska","year":"1992","unstructured":"Christoph Brzoska. Temporal logic programming with metric and past operators. Universit\u00e4t Karlsruhe, P.O.Box 6980, D-7500 Karlsruhe, Germany, January 1992.","volume-title":"Temporal logic programming with metric and past operators"},{"key":"28_CR27","unstructured":"R. Bull and K. Segerberg. Basic modal logic. In D. M. Gabbay and F. Guethner, editors, Handbook of Philosophical Logic, Vol. II, pages 1\u201388. D. Reidel Publishing Company, 1984.","DOI":"10.1007\/978-94-009-6259-0_1","doi-asserted-by":"crossref"},{"key":"28_CR28","unstructured":"J. P. Burgess. Basic tense logic. In D. M. Gabbay and F. Guethner, editors, Handbook of Philosophical Logic, Vol. II, pages 89\u2013134. D. Reidel Publishing Company, 1984.","DOI":"10.1007\/978-94-009-6259-0_2","doi-asserted-by":"crossref"},{"key":"28_CR29","unstructured":"B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.","DOI":"10.1017\/CBO9780511621192","doi-asserted-by":"crossref"},{"key":"28_CR30","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(93)90014-Z","volume":"45","author":"C. Chen","year":"1993","unstructured":"Cheng-Chia Chen and I-Peng Lin. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time logic. Information Processing Letters, 45:131\u2013136, March 1993.","journal-title":"Information Processing Letters"},{"key":"28_CR31","unstructured":"Jan Chomicki and Tomasz Imieli\u0144ski. Temporal deductive databases and infinite objects. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 61\u201373. The Association for Computing Machinery, 1988.","DOI":"10.1145\/308386.308416","doi-asserted-by":"crossref"},{"key":"28_CR32","unstructured":"Eug\u00e8ne Chouraqui. Formal expression of time in a knowledge base. In P. Smets, A. Mamdani, D. Dubois, and H. Prade, editors, Non-Standard Logics for Automated Reasoning, pages 81\u2013103. Academic Press, 1988."},{"key":"28_CR33","author":"J. G. Cleary","year":"1991","unstructured":"John G. Cleary and Vinit N. Kaushik. Updates in a temporal logic programming language. Technical report, Department of Computer Science, University of Calgary, Calgary, Alberta, Canada, 1991.","volume-title":"Technical report"},{"issue":"2","key":"28_CR34","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/319983.319986","volume":"8","author":"J. Clifford","year":"1983","unstructured":"James Clifford and David 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":"28_CR35","unstructured":"W. Clocksin and C. Mellish. Programming in Prolog. Springer-Verlag, 1981."},{"key":"28_CR36","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(92)90290-V","volume":"105","author":"F. Debart","year":"1992","unstructured":"Fran\u00e7oise Debart, Patrice Enjalbert, and Madeleine Lescot. Multimodal logic programming using equational and order-sorted logic. Theoretical Computer Science, 105(1992):141\u2013166, 1992.","journal-title":"Theoretical Computer Science"},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(87)90018-5","volume":"4","author":"L. F. Cerro del","year":"1987","unstructured":"L. Fari\u00f1as del Cerro and M. Penttonen. The complexity of the satisfiability of modal Horn clauses. Journal of Logic Programming, 4:1\u201310, March 1987.","journal-title":"Journal of Logic Programming"},{"key":"28_CR38","unstructured":"Luis Fari\u00f1as del Cerro. A simple deduction method for modal logic. Information Processing Letters, 14(2), 1982.","DOI":"10.1016\/0020-0190(82)90085-0","doi-asserted-by":"crossref"},{"key":"28_CR39","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF03037381","volume":"4","author":"L. F. Cerro del","year":"1986","unstructured":"Luis Fari\u00f1as del Cerro. MOLOG: A system that extends PROLOG with modal logic. New Generation Computing, 4:35\u201350, 1986.","journal-title":"New Generation Computing"},{"key":"28_CR40","unstructured":"Luis Fari\u00f1as del Cerro and Andreas Herzig. Metaprogramming through intensional deduction: some examples. In Meta-Programming in Logic: Proc. of the Third International Workshop, META-92, Uppsala, Sweden, pages 11\u201325. Springer-Verlag, June 1992.","DOI":"10.1007\/3-540-56282-6_2","doi-asserted-by":"crossref"},{"key":"28_CR41","unstructured":"Luis Fari\u00f1as del Cerro and Martti Penttonen, editors. Intensional Logics for Programming. Oxford University Press, 1992. ISBN 019-853775-1."},{"key":"28_CR42","unstructured":"A. A. Faustini and W. W. Wadge. An eductive interpreter for pLucid. Technical Report TR-006-86, Department of Computer Science and Engineering, Arizona State University, 1986."},{"key":"28_CR43","first-page":"209","volume":"XI","author":"M. Fitting","year":"1988","unstructured":"Melvin Fitting. Logic programming on a topological bilattice. Fundamenta Informaticae, XI:209\u201318, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"28_CR44","unstructured":"D. M. Gabbay. Modal and temporal logic programming. In A. Galton, editor, Temporal Logics and Their Applications, pages 197\u2013237. Academic Press, 1987."},{"key":"28_CR45","unstructured":"D. M. Gabbay. A temporal logic programming machine [modal and temporal logic programming, Part 2]. Department of Computing, Imperial College, November 1989."},{"key":"28_CR46","unstructured":"D. M. Gabbay. Metalevel features in the object level: modal and temporal logic programming III. In L. Fari\u00f1as del Cerro and M. Penttonen, editors, Intensional Logics for Programming, pages 85\u2013123. Oxford University Press, 1992."},{"key":"28_CR47","author":"D. Gabbay","first-page":"423","year":"1991","unstructured":"Dov Gabbay and Peter McBrien. Temporal logic & historical databases. In Proceedings of the 17th Very Large Data Bases Conference, pages 423\u2013430, Barcelona, Spain, September 1991. Morgan Kauffman, Los Altos, Calif.","volume-title":"Temporal logic & historical databases"},{"key":"28_CR48","unstructured":"A. Galton. Temporal logic and computer science: an overwiev. In A. Galton, editor, Temporal Logics and Their Applications, pages 1\u201352. Academic Press, 1987."},{"key":"28_CR49","unstructured":"A. Galton, editor. Temporal Logics and Their Applications. Academic Press, 1987."},{"key":"28_CR50","author":"R. Gerth","year":"1988","unstructured":"R. Gerth, M. Codish, Y. Lichtenstein, and E. Y. Shapiro. Fully abstract denotational semantics for Flat Concurrent Prolog. Technical Report CS88-03, Department of Applied Math. and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, April 1988.","volume-title":"Technical Report CS88-03"},{"key":"28_CR51","unstructured":"R. Goldblatt. Logics of Time and Computation. CSLI \u2014 Center for the Study of Language and Information, Stanford University, 1987. Lecture Notes no:7."},{"key":"28_CR52","unstructured":"R. Hale. Temporal logic programming. In A. Galton, editor, Temporal Logics and Their Applications, pages 91\u2013119. Academic Press, 1987."},{"key":"28_CR53","unstructured":"C. Hewitt and Gul Agha. Guarded Horn clause languages: Are they deductive and logical? In Proceedings of the 1988 International Conference on Fifth Generation Computer Systems, pages 650\u2013657. ICOT, 1988."},{"key":"28_CR54","unstructured":"Tomas Hrycej. Temporal Prolog. In Proc. of the European Conference on Artificial Intelligence, pages 296\u2013301, Munich, Germany, 1988."},{"issue":"1&2","key":"28_CR55","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0743-1066(93)90016-A","volume":"15","author":"T. Hrycej","year":"1993","unstructured":"Tomas Hrycej. A temporal extension of Prolog. Journal of Logic Programming, 15(1 & 2):113\u2013145, January 1993.","journal-title":"Journal of Logic Programming"},{"key":"28_CR56","author":"G. E. Hughes","year":"1968","unstructured":"G. E. Hughes and M. J. Creswell. An Introduction to Modal Logic. Methuen and Co Ltd, London, 1968.","volume-title":"An Introduction to Modal Logic"},{"key":"28_CR57","unstructured":"P. Jackson, H. Reichgelt, and F. van Harmelen, editors. Logic-Based Knowledge Representation. MIT Press, 1989."},{"key":"28_CR58","author":"J. Jaffar","first-page":"111","year":"1987","unstructured":"J. Jaffar and J-L. Lassez. Constraint logic programming. In Conference Record of the Fourteenth ACM Symposium on Principles of Programming Languages, pages 111\u2013119, Munich, Germany, 1987. ACM Press.","volume-title":"Constraint logic programming"},{"key":"28_CR59","author":"M. I. Kanovich","first-page":"200","year":"1992","unstructured":"Max I. Kanovich. Linear logic as a logic of computations. In Proc. of the 7th Annual IEEE Symposium on Logic in Computer Science, pages 200\u2013210, Santa Cruz, Calif, June 1992. IEEE Computer Society Press.","volume-title":"Linear logic as a logic of computations"},{"key":"28_CR60","unstructured":"S. Kono, T. Aoyagi, M. Fujita, and H. Tanaka. Implementation of temporal logic programming language Tokio. In E. Wada, editor, Logic Programming'85, volume 221 of LNCS, pages 138\u2013147. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16479-0_14","doi-asserted-by":"crossref"},{"key":"28_CR61","author":"R. A. Kowalski","first-page":"569","year":"1974","unstructured":"R. A. Kowalski. Predicate logic as programming language. In Proceedings of IFIP'74, pages 569\u2013574, Amsterdam, 1974. North-Holland.","volume-title":"Proceedings of IFIP'74"},{"key":"28_CR62","unstructured":"Valentinas Kriau\u010diukas. Non-classical models for logic programs. In PDK'91: International Workshop on Processing Declarative Knowledge, volume 567 of LNAI, pages 179\u2013190. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0013529","doi-asserted-by":"crossref"},{"key":"28_CR63","author":"F. Kroger","year":"1987","unstructured":"Fred Kroger. Temporal Logic of Programs. Springer-Verlag, Berlin Heidelberg, 1987.","volume-title":"Temporal Logic of Programs","DOI":"10.1007\/978-3-642-71549-5","doi-asserted-by":"crossref"},{"key":"28_CR64","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6","doi-asserted-by":"crossref"},{"key":"28_CR65","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In Boyer and Moore, editors, Correctness Problem in Computer Science, pages 215\u2013273. Academic Press, 1981.","DOI":"10.21236\/ADA106750","doi-asserted-by":"crossref"},{"key":"28_CR66","unstructured":"Fujita Masahiro et al. Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis. In E. Wada, editor, Logic Programming'85, volume 221 of LNCS, pages 246\u2013255. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16479-0_24","doi-asserted-by":"crossref"},{"key":"28_CR67","author":"W. H. Mitchell","year":"1988","unstructured":"W. H. Mitchell. Intensional Horn clause logic as a programming language \u2014 it's use and implementation. Master's thesis, Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona, 1988.","volume-title":"Master's thesis"},{"key":"28_CR68","unstructured":"W. H. Mitchell and A. A. Faustini. The intensional logic language InTense. In Proceedings of the 1989 International Symposium on Lucid and Intensional Programming, Arizona State University, May 8 1989."},{"key":"28_CR69","unstructured":"R. Montague. Formal Philosophy, Selected Papers of Richard Montague. Yale University Press, 1974. edited by Richmond Thomason."},{"key":"28_CR70","unstructured":"B. Moszkowski. Executing Temporal Logic Programs. Cambridge University Press, 1986.","DOI":"10.1007\/3-540-15670-4_6","doi-asserted-by":"crossref"},{"key":"28_CR71","unstructured":"Hans J\u00fcrgen Ohlbach. A resolution calculus for modal logics. In E. Lusk and R. Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction, pages 500\u2013516. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0012852","doi-asserted-by":"crossref"},{"key":"28_CR72","author":"M. A. Orgun","year":"1993","unstructured":"M. A. Orgun. On temporal deductive databases. Technical Report 93-140C, Department of Computing, Macquarie University, Sydney, NSW 2109, Australia, December 1993.","volume-title":"Technical Report 93-140C"},{"key":"28_CR73","author":"M. A. Orgun","year":"1994","unstructured":"M. A. Orgun and W. Du. Multi-dimensional logic programming. In Proceedings of ICCI'94: The Sixth International Conference on Computing and Information, Trent University, Peterborough, Ontario, Canada, May 26\u201328 1994. To appear.","volume-title":"Multi-dimensional logic programming"},{"key":"28_CR74","author":"M. A. Orgun","year":"1988","unstructured":"M. A. Orgun and W. W. Wadge. Chronolog: A temporal logic programming language and its formal semantics. Department of Computer Science, University of Victoria, Victoria, B.C., Canada, January 1988.","volume-title":"Chronolog: A temporal logic programming language and its formal semantics"},{"key":"28_CR75","unstructured":"M. A. Orgun and W. W. Wadge. A theoretical basis for intensional logic programming. In Proceedings of the 1988 International Symposium on Lucid and Intensional Programming, pages 33\u201349, Sidney, B.C., Canada, April 7\u20138 1988."},{"key":"28_CR76","unstructured":"M. A. Orgun and W. W. Wadge. Theory and practice of temporal logic programming. In L. Fari\u00f1as del Cerro and M. Penttonen, editors, Intensional Logics for Programming, pages 23\u201350. Oxford University Press, 1992."},{"issue":"4","key":"28_CR77","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0743-1066(92)90055-8","volume":"13","author":"M. A. Orgun","year":"1992","unstructured":"M. A. Orgun and W. W. Wadge. Towards a unified theory of intensional logic programming. Journal of Logic Programming, 13(4):413\u2013440, August 1992.","journal-title":"Journal of Logic Programming"},{"key":"28_CR78","author":"M. A. Orgun","first-page":"120","year":"1993","unstructured":"M. A. Orgun and W. W. Wadge. Chronolog admits a complete proof procedure. In Proceedings of the Sixth International Symposium on Lucid and Intensional Programming, pages 120\u2013135, Universit\u00e9 Laval, Qu\u00e9bec City, Qu\u00e9bec, Canada, April 26\u201327 1993.","volume-title":"Chronolog admits a complete proof procedure"},{"key":"28_CR79","unstructured":"M. A. Orgun and W. W. Wadge. Extending temporal logic programming with choice predicates non-determinism. To appear in Journal of Logic and Computation, 1994.","DOI":"10.1093\/logcom\/4.6.877","doi-asserted-by":"crossref"},{"key":"28_CR80","author":"M. A. Orgun","year":"1993","unstructured":"M. A. Orgun, W. W. Wadge, and W. Du. Chronolog(Z): Linear-time logic programming. In Proceedings of ICCI'93: The Fifth International Conference on Computing and Information, Laurentian University, Sudbury, Ontario, Canada, May 27\u201329 1993. IEEE Computer Society Press.","volume-title":"Linear-time logic programming"},{"key":"28_CR81","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(89)90129-1","volume":"68","author":"R. Ramanujam","year":"1989","unstructured":"R. Ramanujam. Semantics of distributed logic programs. Theoretical Computer Science, 68:203\u2013220, 1989.","journal-title":"Theoretical Computer Science"},{"key":"28_CR82","unstructured":"N. Rescher and A. Urquhart. Temporal Logic. Springer-Verlag, 1971.","DOI":"10.1007\/978-3-7091-7664-1","doi-asserted-by":"crossref"},{"key":"28_CR83","author":"D. W. Rolston","year":"1986","unstructured":"D. W. Rolston. Chronolog: A pure tense-logic-based infinite-object programming language. Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona, August 1986.","volume-title":"Chronolog: A pure tense-logic-based infinite-object programming language"},{"key":"28_CR84","author":"D. W. Rolston","year":"1987","unstructured":"D. W. Rolston. Toward a tense-logic-based mitigation of the frame problem. In F. M. Brown, editor, Proceedings of the 1987 Workshop on the Frame Problem in AI, Lawrence, Kansas, April 1987. Morgan Kaufmann, Los Altos, Calif.","volume-title":"Toward a tense-logic-based mitigation of the frame problem"},{"key":"28_CR85","author":"D. W. Rolston","year":"1992","unstructured":"D. W. Rolston. Parallel Logic Programming Using an Intensional Model of Computation. PhD thesis, Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona, 1992.","volume-title":"PhD thesis"},{"key":"28_CR86","unstructured":"F. Sadri. Three approaches to temporal reasoning. In A. Galton, editor, Temporal Logics and Their Applications, pages 121\u2013168. Academic Press, 1987."},{"key":"28_CR87","unstructured":"Y. Sakakibara. Programming in modal logic: An extension of PROLOG based on modal logic. In E. Wada, editor, Logic Programming'86, volume 264 of LNCS, pages 81\u201391. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18024-9_24","doi-asserted-by":"crossref"},{"key":"28_CR88","unstructured":"Takahashi Sakuragawa. Temporal Prolog. In Proc. of RIMS Conference on Software Science and Engineering. Springer-Verlag, 1987."},{"key":"28_CR89","unstructured":"P. Schroeder-Heister, editor. International Workshop on Extensions of Logic Programming, volume 475 of LNAI. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0038689","doi-asserted-by":"crossref"},{"key":"28_CR90","unstructured":"D. Scott. Advice on modal logic. In K. Lambert, editor, Philosophical Problems in Logic, pages 143\u2013173. D.Reidel Publishing Company, 1970.","DOI":"10.1007\/978-94-010-3272-8_7","doi-asserted-by":"crossref"},{"key":"28_CR91","author":"E. Shapiro","first-page":"359","year":"1991","unstructured":"E. Shapiro. The family of concurrent logic programming languages. In Friedrich L. Bauer, editor, Logic, Algebra, and Computation, pages 359\u2013485. Springer-Verlag, Berlin Heidelberg, 1991.","volume-title":"Logic, Algebra, and Computation","DOI":"10.1007\/978-3-642-76799-9_10","doi-asserted-by":"crossref"},{"key":"28_CR92","unstructured":"Yoav Shoham. Reasoning About Change. MIT Press, 1988."},{"key":"28_CR93","unstructured":"P. Smets, A. Mamdani, D. Dubois, and H. Prade, editors. Non-Standard Logics for Automated Reasoning. Academic Press, 1988."},{"key":"28_CR94","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(86)90157-X","volume":"47","author":"A. Szalas","year":"1986","unstructured":"A. Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoretical Computer Science, 47:329\u2013334, 1986.","journal-title":"Theoretical Computer Science"},{"key":"28_CR95","author":"A. Tuzhilin","first-page":"13","year":"1990","unstructured":"Alexander Tuzhilin and James Clifford. A temporal relational algebra as a basis for temporal relational completeness. In D. McLeod, R. Sacks-Davis, and H. Schek, editors, Proceedings of the 16th International Conference on Very Large Data Bases, pages 13\u201323, Brisbane, Australia, August 13\u201316 1990. Morgan Kaufmann Publishers Inc., Los Altos, Calif.","volume-title":"A temporal relational algebra as a basis for temporal relational completeness"},{"key":"28_CR96","doi-asserted-by":"crossref","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 Association for Computing Machinery, 23:733\u201342, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"28_CR97","unstructured":"M.H. van Emden and M.A. Nait Abdallah. Top-down semantics of fair computations of logic programs. Technical Report CS-84-27, Department of Computer Science, University of Waterloo, October 1984."},{"key":"28_CR98","author":"M. Y. Vardi","first-page":"250","year":"1988","unstructured":"M. Y. Vardi. A temporal fixpoint calculus. In Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, pages 250\u2013259, San Diego, Calif, January 1988. ACM Press.","volume-title":"A temporal fixpoint calculus"},{"key":"28_CR99","author":"W. W. Wadge","year":"1985","unstructured":"W. W. Wadge. Tense logic programming: a respectable alternative. Department of Computer Science, University of Victoria, Victoria, B.C., Canada, 1985.","volume-title":"Tense logic programming: a respectable alternative"},{"key":"28_CR100","unstructured":"W. W. Wadge. Tense logic programming: a respectable alternative. In Proceedings of the 1988 International Symposium on Lucid and Intensional Programming, pages 26\u201332, Sidney, B.C., Canada, April 7\u20138 1988."},{"key":"28_CR101","unstructured":"W. W. Wadge and E. A. Ashcroft. Lucid, the Dataflow Programming Language. Academic Press, 1985."},{"key":"28_CR102","author":"D. H. D. Warren","year":"1983","unstructured":"David H. D. Warren. An abstract Prolog instruction set. Technical report, SRI International, Menlo Park, Calif, October 1983.","volume-title":"Technical report"},{"key":"28_CR103","unstructured":"R. Wojcicki. Theory of Logical Calculi. Kluwer Academic Publishers, 1988.","DOI":"10.1007\/978-94-015-6942-2","doi-asserted-by":"crossref"},{"key":"28_CR104","author":"K. Zhang","year":"1994","unstructured":"K. Zhang and M. A. Orgun. Parallel execution of temporal logic programs using dataflow computation. In Proceedings of ICCI'94: The Sixth International Conference on Computing and Information, Trent University, Peterborough, Ontario, Canada, May 26\u201328 1994. To appear.","volume-title":"Parallel execution of temporal logic programs using dataflow computation"},{"issue":"4","key":"28_CR105","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0167-739X(91)90006-J","volume":"6","author":"K. Zhang","year":"1991","unstructured":"Kang Zhang and R. Thomas. DIALOG \u2014 A dataflow model for parallel execution of logic programs. Future Generation Computer Systems, 6(4):373\u2013388, September 1991.","journal-title":"Future Generation Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Temporal Logic"],"original-title":[],"link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0014004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:36:58Z","timestamp":1586579818000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354058241X"],"references-count":105,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0014004","relation":{"cites":[]}}}