Skip to main content
SpringerLink
Log in

The Logical Approach to Temporal Reasoning

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Temporal reasoning started to be considered as a subject of study in artificial intelligence in the late 1970's. Since then several ways to represent and use temporal knowledge have been suggested. As a result of that, there are several formalisms capable of coping with temporal notions in some way or other. They range from isolated proposals to complex systems where the temporal aspect is used together with other important features for the task of modelling an intelligent agent. The purposes of this article are to summarize logic-based temporal reasoning research and give a glance on the different research tracks envisaging future lines of research. It is intended to be useful to those who need to be involved in systems having these characteristics and also an occasion to present newcomers some problems in the area that still waits for a solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Allen, J. & G. Ferguson (1994). Actions and Events in Interval Temporal Logic. Journal of Logic and Computation 4: 531-579.

    Google Scholar 

  • Allen, J. & P. Hayes (1985). A common-Sense Theory of Time. In Proceedings IJCAI-85, volume 1, 528-531.

    Google Scholar 

  • Allen, J. & P. Hayes (1989). Moments and Points. Computational Intelligence 5: 225-238.

    Google Scholar 

  • Allen, J. & J. Koomen (1983). Planning Using a Temporal World Model. In '83, volume 2.

  • Allen, J., H. Kautz, R. Pelavin & J. Tenenberg (1991). Reasoning About Plans. SanMateo, CA: Morgan Kaufmann.

    Google Scholar 

  • Allen, J. (1983). Maintaining Knowledge about Temporal Intervals. CACM 26(11): 832-843.

    Google Scholar 

  • Allen, J. (1984). Towards a General Theory of Action and Time. Artificial Intelligence 23: 123-154.

    Google Scholar 

  • Allen, J. (1991a). Temporal reasoning and planning. In J. Allen, H. Kautz, R. Pelavin & J. Tenenberg (eds.), Reasoning About Plans. San Mateo, CA: Morgan Kaufmann, 1-68.

    Google Scholar 

  • Allen, J. (1991b). Planning as Temporal Reasoning. In '91, 3-14.

  • Allen, J. (1991c). Formal Models of Planning. In Readings in Planning. Morgan Kaufmann, 50-54.

  • Augusto, J.C. & G.R. Simari (1994). Un sistema argumentativo con referencias a momentos de tiempo. In Proceedings de las 23as Jornadas Argentinas en Informática e Investigación Operativa (JAIIO 94). Buenos Aires: SADIO, 81-92.

    Google Scholar 

  • Augusto, J.C. & G.R. Simari (1999). A Temporal Argumentative System. AI Communications 12(4): 237-257.

    Google Scholar 

  • Augusto, J.C. & G.R. Simari (2001). Defeasible Temporal Reasoning. Knowledge and Information Systems. To be published.

  • Augusto, J.C. (1998). Razonamiento Rebatible Temporal (Defeasible Temporal Reasoning). PhD thesis, Departamento de Cs. de la Computación, Universidad Nacional del Sur, Bahía Blanca, Argentina. In Spanish.

    Google Scholar 

  • Bohlen, M., J. Chomicki, R. Snodgrass & D. Toman (1996). Querying TSQL2 Databases with Temporal Logic. In Proceedings EDBT 96, Lecture Notes in Computer Science 1057, 325-341.

  • Barringer, H., M. Fisher, D. Gabbay & G. Gough (eds.) (2000). Advances in Temporal Logic, Applied logic series, Volume 16. Dordrecht, Boston: Kluwer Academic Publishers.

    Google Scholar 

  • Borillo, M. & B. Gaume (1990). An Extension to Kowalski and Sergot Event Calculus. In Proceedings of the European Conference of Artificial Intelligence-ECAI' 90, 99-104.

  • Barber, F. & S. Moreno (1997). Representation of Continuous Change with Discrete Time. In Proceedings of the 4th International Conference on Temporal Representation and Reasoning (TIME97), 175-179.

  • Bochman, A. (1990a). Concerted Instant-Interval Temporal Semantics I: Temporal Ontologies. Notre Dame Journal of Formal Logic 31(3): 403-414.

    Google Scholar 

  • Bochman, A. (1990b). Concerted Instant-Interval Temporal Semantics II: Temporal Valuations and Logics of Change. Notre Dame Journal of Formal Logic 31(4): 581-601.

    Google Scholar 

  • Brown, F. (1991). The Modal Quantificational Logic Z Applied to the Frame Problem, volume 3.

  • Bruce, B. (1972). A Model for Temporal References and its Application in a Question Answering Program. Artificial Intelligence 3: 1-25.

    Google Scholar 

  • Bacchus, F., J. Tenenberg & J. Koomen (1991). A Non-Reified Temporal Logic. Artificial Intelligence 52: 87-108.

    Google Scholar 

  • Cervesato, I., L. Chittaro & A. Montanari (1994). Modal Event Calculus. In M. Bruynooghe (ed.), Proceedings of the 11th International Logic Programming Symposium. Ithaca, USA: MIT Press, 675.

    Google Scholar 

  • Cervesato, I., L. Chittaro & A. Montanari (1995). A Modal Calculus of Partially Ordered Events in a Logic Programming Framework. In Proceedings of the 12th International Conference on Logic Programming. Kanegawa, Japan: MIT Press, 299-313.

    Google Scholar 

  • Cervesato, I., M. Franceschet & A. Montanari (1997a). The Complexity of Model Checking in Modal Event Calculi. In Proceedings of the Fourteenth International Conference on Logic Programming-ICLP'97.

  • Cervesato, I., M. Franceschet & A. Montanari (1997b). A Hierarchy of Modal Event Calculi: Expressiveness and Complexity. In Proceedings of the Second International Conference on Temporal Logic, ICTL'97, 1-17.

  • Cervesato, I., M. Franceschet & A. Montanari (1997c). Modal Event Calculi with Preconditions. In Proceedings of the Fourth International Workshop on Temporal Representation and Reasoning-TIME'97, 38-45.

  • Cervesato, I., M. Franceschet & A. Montanari (1998a). The Complexity of Model Checking in Modal Event Calculi with Quantifiers. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning-KR'98.

  • Cervesato, I., M. Franceschet & A. Montanari (1998e). Event Calculus with Explicit Quantifiers. In Proceedings of the Fifth International Workshop on Temporal Representation and reasoning-TIME'98.

  • Cuckierman, D. & J. Delgrande (1998). Towards a Formal Characterization of Temporal Repetition with Closed Time. In Proceedings of TIME98. IEEE Computer Society Press, 140-147.

  • Chellas, B.F. (1980). Modal Logic. An Introduction. Cambridge University Press.

  • Chesñevar, C., A. Maguitman & R. Loui (2001). Logical Models of Argument. To be published.

  • Chittaro, L., S. Goodwin, H. Hamilton & A. Montanari (eds.) Proceedings of the Tirdh International Workshop on Temporal Representation and Reasoning. Los Alamitos, California, USA: IEEE Computer Society Press.

  • Chitaro, L. & A. Montanari (1996). Efficient Temporal Reasoning in the Cached Event Calculus. Computational Intelligence 12(3): 359-382.

    Google Scholar 

  • Clark, K.L. (1978). Negation as Failure. In Herve Gallaire & Jack Minker (eds.), Logic and Data Bases. New York: Plenum Press, 293-322.

    Google Scholar 

  • Davidson, D. (1980). Essays on Actions and Events. Oxford: Clarendon Press.

    Google Scholar 

  • Davis, W. & J. Carnes (1991). Clustering Temporal Intervals to Generate Reference Hierarchies. In '91, 111-117.

  • Davis, R. (1988). Truth, Deduction and Computation. New York: H. Freeman.

    Google Scholar 

  • Dean, T. & M. Boddy (1988). Reasoning about PartiallyOrdered Events. Artificial Intelligence 36: 375-399.

    Google Scholar 

  • Dean, T. & D. Mc Dermott (1987). Temporal data Base Management. Artificial Intelligence 32: 1-55.

    Google Scholar 

  • Dean, T. (1985). Temporal Imagery: An Approach to Reasoning about Time for Planning and Problem Solving. PhD thesis, Yale University.

  • Dean, T. (1989). Using Temporal Hierarchies to Efficiently Mantain Large Databases. Journal of the A. C.M. 36(4): 687-718.

    Google Scholar 

  • Dorn, J. (1992). Temporal Reasoning in Sequence Graphs. In Proceedings of the 10th National Conference on Artificial Intelligence. AAAI, AAAI Press/MIT Press, 735-740.

  • Ferguson, G. & J. Allen (1994). Arguing about Plans: Plan Representation and Reasoning for Mixed-Initiative Planning. In Proceedings of Second Conference on AI Planning Systems. Chicago, USA, 43-38.

  • Ferguson, G.M. (1995). Knowledge Representation and Reasoning for Mixed-Initiative Planning. PhD thesis, Departament of Computer Science, Universitiy of Rochester.

  • Fikes, R. & N. Nilson (1971). STRIPS, a new Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 2(2): 189-208.

    Google Scholar 

  • Freksa, C. (1992). Temporal Reasoning Based on Semi-Intervals. Artificial Intelligence 54: 199-227.

    Google Scholar 

  • Fusoaka, A. (1996). Nonmonotonic reasoning on a Constructive Time Structure. In Proceedings of TIME96, 190-195.

  • Gabbay, D., I. Hodkinson & M. Reynolds (1994). Temporal Logic (Mathematical Foundations and Computational Aspects). Oxford: Clarendon Press.

    Google Scholar 

  • Gabbay, D. & H. Ohlbach (eds.) (1994). Proceedings of the First International Conference on Temporal Logic. Bonn, Germany: Springer Verlag.

    Google Scholar 

  • Gabbay, D. & H. Barringer (eds.) (1997). Proceedings of the Second International Conference on Temporal Logic. Manchester, UK: Applied Logic Series. Kluwer. To Appear.

    Google Scholar 

  • Galton, A. (1984). The Logic of Aspect. Oxford: Clarendon Press.

    Google Scholar 

  • Galton, A. (1987a). Temporal Logics and their Applications. San Diego, CA: Academic Press.

    Google Scholar 

  • Galton, A. (1987b). The Logic of Occurrence. In Antony Galton (ed.), Temporal Logic and their Applications. Academic Press, 169-196.

  • Galton, A. (1990). A Critical Examination of Allen's Theory of Action and Time. Artificial Intelligence 42: 159-188.

    Google Scholar 

  • Galton, A. (1991). A Critique of Yoav Shoham's Theory of Causal Reasoning. In Proceedings of the 9th National Conference on Artificial Intelligence, volume 1, 355-359.

    Google Scholar 

  • Galton, A. (1995). Time and Change. In D. Gabbay, C. Hogger & J. Robinson (eds.), Hanbook of Logic in Artificial Intelligence and Logic Programming-Vol. 4 (Epistemic and Temporal Reasoning). Clarendon Press, 175-240.

  • Galton, A. (1995). Qualitative Spatial Change. Oxford University Press.

  • Gerevini, A. & L. Schubert (1993). Efficient Temporal Reasoning through Timegraphs. In Ruzena Bajcsy (ed.), Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI 93), volume 1. San Mateo, CA: IJCAI, Morgan Kaufmann Publishers, 648-654.

    Google Scholar 

  • Ginsberg, M.L. (1994). Essentials of Artificial Intelligence. San Mateo, CA: Morgan Kaufmann Publishers, Inc.

    Google Scholar 

  • Goldblatt, R. (1987). Logics of Time and Computation (Second Edition). New York: CSLI, Princeton.

    Google Scholar 

  • Goldman, A. (1970). A Theory of Human Action. Princeton, New York: Princeton University Press.

    Google Scholar 

  • Golumbic, M. & R. Shamir (1992). Algorithms and Complexity for Reasoning about Time. In Proceedings of the 10th National Conference on Artificial Intelligence. AAAI, AAAI Press/MIT Press, 741-747.

  • Gooday, J. & A. Galton (1997). The Transition Calculus: a High-Level Formalism for Reasoning about Action and Change. Journal of Experimental and Theoretical Artificial Intelligence 9: 51-66.

    Google Scholar 

  • Goodwin, S., E. Neufeld & A. Trudel (1991). Probabilistic Rregions of Persistence. Technical report, Acadia University.

  • Goodwin, S., E. Neufeld & A. Trudel (1992a). Definite Integral Information. Technical report, Acadia University.

  • Goodwin, S., E. Neufeld & A. Trudel (1992b). Temporal Reasoning with Real Valued Functions. Technical report, Acadia University.

  • Goodwin, S. & A. Trudel (1991). Persistence in Continous First Order temporal Logics. International Journal of Expert Systems 3: 249-265.

    Google Scholar 

  • Goodwin, S. & A. Trudel (eds.) (2000). Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning. Cape Breton, Canada: IEEE Computer Society Press.

    Google Scholar 

  • Guzmán, I., M. Enciso & C. Rossi (1995). Just One Approach for Several Temporal Logics in Computing: the Topológical Semantics. In Proceedings of Time 95.

  • Guzmán, I. & C. Rossi (1995). Lnint: a Temporal Logic that Combines Points and Intervals and the Absolute and Relative Approach. Bulletin of IGPL 3(1): 1-20.

    Google Scholar 

  • Haack, S. (1978). Philosophy of Logics. Cambridge: Cambridge University Press.

    Google Scholar 

  • Hajnicz, E. (1987). An Analysis of Structure of Time in the First Order Predicate Calculus. In L. Bolc & A. Szalas (eds.), Time and Logic: a Computational Approach. UCL Press, 279-321.

  • Halpern, J. & Y. Shoham (1986). A propositional Modal Logic of Time Intervals. In Proceedings of Symposium of Logic in Computer Science. Boston, MA: IEEE.

    Google Scholar 

  • Halpern, J. & Y. Shoham (1991). A Propositional Modal Logic of Time Intervals, volume 38, 935-962.

    Google Scholar 

  • Hamblin, C.L. (1972). Instants and Intervals. In F. Haber J. Fraser & G. Muller (eds.), The Study of Time. New York: Springer Verlag, 324-328.

    Google Scholar 

  • Hanks, S. & D. McDermott (1986). Default Reasoning, Nonmonotonic Logics and the Frame Problem. In Proceedings of the 4th National Conference on Artificial Intelligence, 390-395.

  • Hanks, S. & D. McDermott (1987). Nonmonotonic Logic and Temporal Projection. Artificial Intelligence 33: 379-412.

    Google Scholar 

  • Ho, E. & A. Trudel (1994). The Specification and Implementation of a First Order Logic for Uncertain Temporal Domains. In Proceedings of the 10th Canadian Conference on Artificial Intelligence, 205-212.

  • Hobbs, J.R. (1985). Granularity. In Proceedings of the IJCAI 85. IJCAI, 432-435.

  • Kahn, K. & G. Gorry (1977). Mechanizing Temporal Knowledge. Artificial Intelligence 9: 87-108.

    Google Scholar 

  • Kamp, H. (1979). Events, Instants and Temporal Reference. In Baurle et al. (eds.), Semantics from Different Points of View. Springer Verlag, 376-417.

  • Kautz, H. (1986). The Logic of Persistence. In Proceedings of the 5th National Conference on Artificial Intelligence. AAAI, AAAI Press/MIT Press, 401-405.

  • Khatib, L. & R. Morris (eds.) (1998). Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning. Los Alamitos, California, USA: IEEE Computer Society Press.

    Google Scholar 

  • Kowalski, R. (1992). Database Updates in the Event Calculus. Journal of Logic Programming 12: 121-146.

    Google Scholar 

  • Kowalski, R. & F. Sadri (1994). The Situation Calculus and Event Calculus Compared. In M. Bruynooghe (ed.), Proceedings of the 1994 International Symposium of Logic Programming, 539-553.

  • Kowalski, R. & M. Sergot (1986). A Logic-Based Calculus of Events. New Generation Computing 4: 67-95.

    Google Scholar 

  • Ladkin, P. & R. Maddux (1988). The Algebra of Convex Time Intervals. Technical report, Kestrel Institute, Palo Alto, California.

    Google Scholar 

  • Ladkin, P. & R. Maddux (1992). On Binary Constraint Problems. Technical report, Universitat Bern.

  • Ladkin, P. (1986). Time Representation: A Taxonomy of Interval Relations. In Proceedings of the 4th National Conference on Artificial Intelligence, 360-366.

  • Ladkin, P. (1987). Models of Axioms for Time Intervals. In Proceedings of the 5th National Conference on Artificial Intelligence, 234-239.

  • Lee, R., M. Cohelo & H. Cotta (1985). Temporal Inferencing on Administrative Databases. Information Systems 10(2): 197-206.

    Google Scholar 

  • Leasure, D. (1996). Temporal Reasoning with theModal Logic Z. Computational Intelligence 12(3): 407-422.

    Google Scholar 

  • Lespérance, Y., H.J. Levesque & R. Reiter (1999). A Situation Calculus Approach to Modeling and Programming Agents. In A. Rao & M. Wooldridge (eds.), Foundations and Theories of Rational Agency. Kluwer.

  • Lifschitz, V. & A. Rabinov (1989). Miracles in Formal Theories of Action. Artificial Intelligence (38): 225-237.

  • Lifschitz, V. (1987). On the Declarative Semantics of Logic Programs with Negation. In Jack Minker (ed.), Foundations of Deductive Databases and Logic Programming. Los Altos, CA: Morgan Kaufmann Publishers, 177-192.

    Google Scholar 

  • Ligozat, G. & H. Bestougeff (1989). On Relations between Intervals. InformationProcessing Letters 32: 177-182.

    Google Scholar 

  • Ligozat, G. (1986). Points et Intervalles Combinatoires. T. A. Informations 1: 3-15.

    Google Scholar 

  • Ligozat, G. (1990a). Intervalles généralisés i. Technical report, C.R. de Sci. Paris.

  • Ligozat, G. (1990b). Intervalles généralisés ii. Technical report, C.R. de Sci. Paris.

  • Ligozat, G. (1990c). Weak Representations of Interval Algebras. In Proceedings of the 8th National Conference on Artificial Intelligence, 715-720.

  • Ligozat, G. (1991). On Generalized Interval Calculi. In Proceedings of the 9th National Conference on Artificial Intelligence, 234-240.

  • Lin, Y. (1994). A Commonsense Theory of Time-Lnai 810. In Lakemeyer and Nebel (eds.), Foundations of Knowledge Representation and Reasoning. Springer Verlag, 216-228.

  • McArthur, R. (1976). Tense Logic. Reidel.

  • McCarthy, J. & Patrick J. Hayes (1969). Some Philosophical Problems from the Standpoint of Artificial Intelligence. In B. Meltzer & D. Mitchie (eds.), Machine Intelligence 4. Edinburgh University Press, 463-502.

  • McCarthy, J. (1980). Circumscription-A Form of Non-monotonic Reasoning. Artificial Intelligence 13: 27-39, 171-172.

    Google Scholar 

  • McCarthy, J. (1986). Applications of Circumscription to Formalizing Common-Sense Knowledge. Artificial Intelligence 28(1): 89-116.

    Google Scholar 

  • McDermott, D. (1982). A Temporal Logic for Reasoning about Plans and Actions. Cognitive Science 6: 101-155.

    Google Scholar 

  • Mendelson, E. (1987). Introduction to Mathematical Logic. Wadsworth and Brooks/Cole, third edition.

  • Miller, R. (1995). Situation Calculus Specifications for Event Calculus Logic Programs. In Proceedings of the Third International Conference on Logic Programming and Non-monotonic Reasoning. Lexington, U. S.A.: Springer Verlag.

    Google Scholar 

  • Miller, R. (1996). A Case Study about Actions and Continuous Change. ECSTER Newsletter (2).

  • Morgenstern, L. & L. Stein (1998). Why Things Go Wrong: A Formal Theory of Causal Reasoning. Technical report, Brown University, Departament of Computer Science.

  • Morris, R. & L. Khatib (eds.) (1994). Proceedings of the First International Workshop on Temporal Representation and Reasoning. Daytona Beach, FL: Florida Artificial Intelligence Research Society.

    Google Scholar 

  • Morris, R. & L. Khatib (eds.) (1995). Proceedings of the Second International Workshop on Temporal Representation and Reasoning. Melbourne, FL: Florida Artificial Intelligence Research Society.

    Google Scholar 

  • Morris, R. & L. Khatib (eds.) (1997). Proceedings of the Fourth International Workshop on Temporal Representation and Reasoning. Los Alamitos, CA: IEEE Computer Society Press.

    Google Scholar 

  • Morris, R. & L. Khatib (eds.) (1999). Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning. Los Alamitos, CA: IEEE Computer Society Press.

    Google Scholar 

  • Moszkowski, B. (1986). Executing Temporal Logic. Cambridge: Cambridge University Press.

    Google Scholar 

  • Nebel, B. & H. Bürckert (1995). Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. Journal of the Association for Computing Machinery 42(1): 43-66.

    Google Scholar 

  • Newton-Smith, W.H. (1980). The Structure of Time. London: Routledge and Kegan Paul.

    Google Scholar 

  • Nute, D. (1989). Defeasible Logic and Temporal Projection. In Proceedings of the 22nd Hawaii International Conference on System Science, volume 3. Washington: IEEE, IEEE Computer Society Press, 575-581.

    Google Scholar 

  • Nute, D. (1990). Defeasible Logic and the Frame Problem. In H.E. Kyburg, Ronald Loui & Greg Carlson (eds.), Knowledge Representation and Defeasible Logic. Boston: Kluwer Academic Publishers, 3-21.

    Google Scholar 

  • Orgun, M. & W. Ma (1994). An Overview of Temporal and Modal Logic Programming. In Proceedings of the FICTL (ICTL 94). Bonn: Springer Verlag, 445-479.

    Google Scholar 

  • Pinto, J. (1994). Temporal Reasoning in the Situation Calculus. PhD thesis, University of Toronto.

  • Pinto, J. & R. Reiter (1993). Temporal Reasoning in Logic Programming: A Case for the Situation Calculus. In Proceedings of the Tenth International Conference on Logic Programming, 203-221.

  • Prior, A. (1967). Past, Present and Future. Clarendon Press.

  • Provetti, A. (1994). Hypothetical Reasoning from Situation Calculus to Event Calculus. In Proceedings of the TIME-94 International Workshop on Temporal Representation and Reasoning, 42-47.

  • Reichgelt, H. (1989). A Comparison of First Order and Modal Logics of Time. In P. Jackson, H. Reichgelt & F. van Harmelen (eds.), Logic Based Knowledge Representation. Cambridge, MA: MIT Press, 143-176.

    Google Scholar 

  • Rescher, N. & A. Urquart (1971). Temporal Logic. Springer Verlag.

  • Reynolds, M. (1994). Axiomatisation and Decidability of F and P in Cyclical Time. Journal of Philosophical Logic (23): 197-224.

  • Russell, B. (1936). On Order in Time. Proceedings of the Cambridge Philosophical Society (32): 216-228.

  • Sacerdoti, E. (1977). Planning in a Hierarchy of Abstraction Spaces. Artificial Intelligence (7): 231-272.

  • Sadri, F. & R. Kowalski (1995). Variants of the Event Calculus. In Proceedings of International Conference of Logic Programming.

  • Sadri, F. (1987). Three Recent Aproaches to Temporal Reasoning. In A. Galton (ed.), Temporal Logics and their Applications, chapter 4. Academic Press.

  • Sandewall, E. (1993). The Range of Applicability of Nonmonotonic Logics for the Inertia Problem. In Ruzena Bajcsy (ed.), Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI 93), volume 1. San Mateo, CA: IJCAI, Morgan Kaufmann Publishers, 738-743.

    Google Scholar 

  • Sandewall, E. (1994). Features and Fluents. Oxford: Oxford University Press.

    Google Scholar 

  • Schrag, R., M. Boddy & J. Carcifoni (1992). Managing Disjunction for Practical Temporal Reasoning. In Ch. Rich B. Nebel & W. Swartout (eds.), Proceedings of 3td Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 92). Cambridge, Massachusetts, 36-46.

  • Schubert, L. (1990). Monotonic Solution of the Frame Problem Iin the Situation Calculus: An Efficient Method for Worlds with Fully Specified Actions. In H. Kyburg, R. Loui & G. Carlson (eds.), Knowledge Representation and Defeasible Reasoning. Kluwer Academic Publisher, 23-67.

  • Schubert, L. (1994). Explanation Closure, Action Closure and the Sandewal Test Suite for Reasoning about Change. Journal of Computation and Logic 5(4): 679-700.

    Google Scholar 

  • Shanahan, M. (1990). Representing Continuous Change in the Event Calculus. In Proceedings of the European Conference of Artificial Intelligence-ECAI' 90, 598-603.

  • Shoham, Y. & D. McDermott (1988). Problems in Formal Temporal Reasoning. Artificial Intelligence 36: 49-61.

    Google Scholar 

  • Shoham, Y. (1985). Ten Requirements for a Theory of Change. New Generation Computing 3: 467-477.

    Google Scholar 

  • Shoham, Y. (1987a). Temporal Logics in Artificial Intelligence: Semantical and Ontological Considerations. Artificial Intelligence 33: 89-104.

    Google Scholar 

  • Shoham, S. (1987b). Reasoning About Change. Boston: Cambridge Press.

    Google Scholar 

  • Shoham, S. (1987c). A Semantical Approach to Nonmonotonic Logics. In Proceedings of the 5th National Conference on Artificial Intelligence, 227-250.

  • Shoham, Y. (1988a). Chronological Ignorance: Experiments in Nnonmonotonic Temporal Reasoning. Artificial Intelligence 36: 279-331.

    Google Scholar 

  • Shoham, Y. (1988b). Time for Action: On the Relation Between Time, Knowledge, and Action. Technical report, Stanford University, Departament of Computer Science.

  • Shoham, Y. (1990). Nonmonotonic Reasoning and Causation. Cognitive Science 14: 213-252.

    Google Scholar 

  • Song, F. & R. Cohen (1991). Temporal Reasoning during Plan Recognition. In Proceedings of the 9th National Conference on Artificial Intelligence.

  • Trudel, A. (1990). Representing and Reasoning about a Dynamic World. PhD thesis, University of Waterloo, Canada.

    Google Scholar 

  • Trudel, A. (1991a). The Interval Representation Problem. International Journal of Intelligence Systems 6(5): 509-547.

    Google Scholar 

  • Trudel, A. (1991b). An Implementation of a Temporal Logic. Technical report, Acadia University.

  • Turner, R. (1984). Logic for Artificial Intelligence. John Wiley & Sons.

  • Van Benthem, J.F.A.K. (1991). The Logic of Time (second edition). Reidel.

  • Van Benthem, J.F.A.K. (1996). Exploring Logical Dynamics. Stanford: CSLI Publications.

    Google Scholar 

  • Van Belleghem, K., M. Denecker & D. DeSchreye (1995). The Abductive Event Calculus as a General Framework for Temporal Databases. In Ohlbach Gabbay, Jurgen (ed.), First International Conference of Temporal Logic (ICTL 94). Springer Verlag, 301Ů316.

  • Vila, Ll. & H. Reichgelt (1993). The Token Reification Approach to Temporal Reasoning. Technical report, The University of West Indias.

  • Vila, Ll. (1994). Ip: An Instant-Period Based Theory of Time. In R. Rodriguez (ed.), Proceedings of the Workshop on Spatial and Temporal Reasoning in ECAI 94.

Download references

Author information

Authors and Affiliations

  1. Departamento de Cs. de la Computación, Universidad Nacional del Sur, Bahía Blanca, Argentina (E-mail

    Juan Carlos Augusto

Authors
  1. Juan Carlos Augusto
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Augusto, J.C. The Logical Approach to Temporal Reasoning. Artificial Intelligence Review 16, 301–333 (2001). https://doi.org/10.1023/A:1012551818243

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012551818243

Search

Navigation