Skip to main content

Time, tense, and relativity revisited

  • 5. Non-Standard Logics
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 521))

Abstract

Interest in the problem of expressing temporal relations between events in a coherent fashion has undergone a revival due to the creation of data bases and knowledge bases containing time-dependent information and also through the scrutiny of concurrent algorithms and real-time systems. Presented herein is a simple temporal model, designated an F-complex, which develops from a single future operator and a single order axiom yet encompasses several of the current proposals for models to systematize reasoning about one or more of the aforementioned areas. The rudimentary F-complex commits to no special ontology of time, giving the advantage of clarifying the properties which are common to most methods of temporal modeling. Concepts of past, future, and temporal precedence are formulated within the posited structure, allowing comparison to the published temporal models of Lamport [11], Allen [1], Milner [14], Rodriguez [17], and others [21]. Specifically, Allen's thirteen linear-time and Rodriguez's eighty-two relativistic atomic relations are characterized, as well as the axiomatic scheme of Lamport. The models are treated more thoroughly than in [6]. Furthermore, the main theorem is strengthened.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J. Maintaining Knowledge about Temporal Intervals. Comm. of ACM 26, 11 (1983), pp. 832–843.

    Article  Google Scholar 

  2. Allen, J. Towards a General Theory of Action and Time. Artificial Intelligence 23, (1984), pp. 123–154.

    Article  Google Scholar 

  3. Allen, J. and Hayes, P. A Commonsense Theory of Time. Proceedings of IJCAI, Los Angeles, CA, 1985, pp. 528–531.

    Google Scholar 

  4. Anger, F., Morris, R., Rodriguez, R., Mata, R. A Temporal Logic for Reasoning in Distributed Systems, Australian Joint AI Conference, Adelaide, Australia, Nov 1988, pp. 146–155. (Also in Lecture Notes in Artificial Intelligence, Vol. 406, C. Barter and M. Brooks, eds., Springer-Verlag, 1990, pp. 177–186.)

    Google Scholar 

  5. Anger, F. On Lamport's Interprocessor Communication Model. ACM Trans. on Prog. Lang. and Systems 11, 3 (July 1989), pp. 404–417.

    Article  Google Scholar 

  6. Anger, F. and Rodriguez, R. Time, Tense, and Relativity. Proceedings of Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU), Paris, France, (July 1990), pp. 74–78.

    Google Scholar 

  7. Anger, F., Ladkin, P., and Rodriguez, R. Atomic Temporal Interval Relations in Branching Time: Calculation and Application. Applications of Artificial Intelligence IX, Proceedings of SPIE, Orlando, (April 1991).

    Google Scholar 

  8. Dean, T. and Boddy, M. Reasoning about Partially Ordered Events. Artificial Intelligence 36, 3 (Oct 1988), pp. 375–399.

    Article  Google Scholar 

  9. Ladkin, P. Specification of Time Dependencies and Synthesis of Concurrent Processes. Ninth ACM Software Engineering Conference, (1987), pp. 106–115.

    Google Scholar 

  10. Ladkin, P. Satisfying First-Order Constraints about Time Intervals. Proceedings of the Seventh National Conference on Artificial Intelligence, St. Paul, MN, (Aug 1988), pp. 512–517.

    Google Scholar 

  11. Lamport, L. The Mutual Exclusion Problem: Part I-A Theory of Interprocess Communication. Journal ACM 33, 2 (April 1986), pp. 313–326.

    Article  Google Scholar 

  12. Lamport, L. The mutual exclusion problem: Part II-Statement and Solutions. Journal ACM 33, 2 (April 1986), pp. 327–348.

    Article  Google Scholar 

  13. Leban, B., McDonald, D., Forster, D. A Representation for Collections of Temporal Intervals. Proceedings of the Fifth National Conference on Artificial Intelligence, Pittsburgh, PA, (July 1986), pp. 367–371.

    Google Scholar 

  14. Milner, R. A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sci., Vol. 92, 1980.

    Google Scholar 

  15. Prior, A. Past, Present, and Future. Clarendon Press, Oxford, 1967.

    Google Scholar 

  16. Rodriguez, R., Anger, F. Reasoning in Relativistic Time. Submitted to Computational Intelligence Journal. July 1989.

    Google Scholar 

  17. Rodriguez, R., Anger, F., Ford, K. Temporal Reasoning: A Relativistic Model. International Journal of Intelligent Systems, to appear.

    Google Scholar 

  18. Rodriguez, R. and Anger, F. Prior's Temporal Legacy in Computer Science. To appear in The Arthur Prior Memorial Volume, Oxford University Press, Oxford, 1991.

    Google Scholar 

  19. Winskel, G. An Introduction to Event Structures. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, G. Goos and J. Hartmanis, eds., Springer-Verlag, New York, 1989, pp. 1–49.

    Google Scholar 

  20. van Benthem, J. A Manual of Intensional Logic, 2nd ed. Center for the Study of Language and Information (CSLI), Stanford, CA, 1988.

    Google Scholar 

  21. van Benthem, J. Time, Logic and Computation. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, G. Goos and J. Hartmanis, eds., Springer-Verlag, New York, 1989, pp. 1–49.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernadette Bouchon-Meunier Ronald R. Yager Lotfi A. Zadeh

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anger, F.D., Rodriguez, R.V. (1991). Time, tense, and relativity revisited. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Uncertainty in Knowledge Bases. IPMU 1990. Lecture Notes in Computer Science, vol 521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028115

Download citation

  • DOI: https://doi.org/10.1007/BFb0028115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54346-6

  • Online ISBN: 978-3-540-47580-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics