Advertisement

The Imperative Future: Past Successes ⇒ Future Actions

  • Howard Barringer
  • Dov Gabbay
Conference paper
Part of the Mathematical Sciences Research Institute Publications book series (MSRI, volume 21)

Abstract

We present a new paradigm of reading future temporal formulae imperatively. A future formula is understood as a command to take action to make it true. With this point of view, temporal logic can be used as an imperative language for actions and control.

Keywords

Temporal Logic Logic Programming Integrity Constraint Horn Clause Temporal Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aba87a]
    M. Abadi, Temporal-Logic Theorem Proving, PhD thesis, Department of Computer Science, Stanford University, March 1987.Google Scholar
  2. [Aba87b]
    M. Abadi, The Power of Temporal Proofs, In “Proc. Symp. on Logic in Computer Science”, pages 123–130, Ithaca, June 1987. Google Scholar
  3. [AM85]
    M. Abadi and Z. Manna, Non-clausal Temporal Deduction, Lecture Notes in Computer Science, 193, 1–15, June 1985.MathSciNetGoogle Scholar
  4. [AM86]
    M. Abadi and Z. Manna, A Timely Resolution, In “Proc. Symp. on Logic in Computer Science”, pages 176–186, Boston, June 1986.Google Scholar
  5. [Bau89]
    M. Baudinet, Temporal Logic Programming is Complete and Expressive, In “Proceedings of ACM Symposium on Principles of Programming Languages”, Austin, Texas, January 1989.Google Scholar
  6. [BFG+90]
    H. Barringer, M. Fisher, D. Gabbay, G. Gough, and P. Owens, MetateM: A Framework for Programming in Temporal Logic, In “Proc. of REX Workshop: Stepwise Refinement of Distributed Systems - Models, Formalisms and Correctness”, pages 94–129, LNCS Vol. 430, Springer-Verlag, May 1990.Google Scholar
  7. [Fis88]
    M. D. Fisher, Implementing a Prototype METATEM Interpreter, Temple Group Report, Department of Computer Science, University of Manchester, November 1988.Google Scholar
  8. Gab87.
    D. Gabbay, Modal and Temporal Logic Programming, In A. Galton, editor, “Temporal Logics and their Applications”, Academic Press, London, December 1987.Google Scholar
  9. [Gab89]
    D. Gabbay, Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems, In B. Banieqbal, H. Barringer, and A. Pnueli, editors, “Proceedings of Colloquium on Temporal Logic in Specification”, Altrincham, 1987, LNCS Vol. 398, pages 402–450, Springer-Verlag, 1989. Google Scholar
  10. [GH89]
    D.M. Gabbay and I.M. Hodkinson, Nonmonotonic coding of the declarative past, Draft Report, October 1989.Google Scholar
  11. [Hal87]
    R. Hale, Temporal Logic Programming, In A. Galton, editor, “Temporal Logics and their Applications”, chapter 3, pages 91–119, Academic Press, London, December 1987.Google Scholar
  12. [HNNT86]
    T. Hattori, R. Nakajima, N. Niide, and K. Takenaka, RACCO: A Modal-Logic Programming Language for Writing Models of Real-time Process-Control Systems, Technical report, Research Institute for Mathematical Sciences, Kyoto University, November 1986.Google Scholar
  13. [MM84]
    . Moszkowski and Z. Manna, Reasoning in Interval Temporal Logic, In “AMC/NSF/ONR Workshop on Logics of Programs” pages 371–383, Berlin, 1984, LNCS Vol. 164, Springer-Verlag.Google Scholar
  14. Mos83.
    B. Moszkowski, Resoning about Digital Circuits, PhD thesis, Department of Computer Science, Stanford University, July 1983.Google Scholar
  15. [Mos86]
    B. Moszkowski, Executing Temporal Logic Programs, Cambridge University Press, Cambridge, England, 1986.Google Scholar
  16. [Sak86]
    T. Sakuragawa, Temporal Prolog, Technical report, Research Institute for Mathematical Sciences, Kyoto University, 1986, to appear in Computer Software.Google Scholar
  17. [Zhi83]
    Tang Zhisong , Toward a Unified Logic Basis for Programming Languages, In R. E. A. Mason, editor, “Information Processing 83”, pages 425–429, IFIP, Elsevier Science Publishers B.V. (North Holland), Amsterdam, 1983.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1992

Authors and Affiliations

  • Howard Barringer
    • 1
  • Dov Gabbay
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterUK

Personalised recommendations