Skip to main content
SpringerLink
Log in

Automated Proof Support for Interval Logics

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2250))

Abstract

We outline the background and motivation for the use of interval logics and consider some initial attempts toward proof support and automation. The main focus, though, is on recent work on these subjects. We compare different proof theoretical formalisms, in particular a “classical” versus a “labelled” one. We discuss encodings of these in the generic proof assistant Isabelle and consider some examples which show that in some cases the labelled formalism gives an order of magnitude improvement in proof length compared to a classical approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Bjørner et al. A ProCoS Project Description: ESPRIT BRA 3104. Bulletin of the EATCS, G. Rozenberg (Ed.), (39):60–73, 1989.

    Google Scholar 

  2. R.A. Bull and K. Segerberg. Basic Modal Logic. In D.M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume II, pages 1–88. Reidel, 1984.

    Google Scholar 

  3. B. Dutertre. Complete Proof Systems for First Order Interval Temporal Logic. In LICS’95, pages 36–43. IEEE, 1995.

    Google Scholar 

  4. D.M. Gabbay. Labelled Deductive Systems, volume I. Oxford, 1996.

    Google Scholar 

  5. J.Y. Halpern, B. Moszkowski, and Z. Manna. A Hardware Semantics based on Temporal Intervals. In ICALP’83, volume 154 of LNCS, pages 278–291. Springer, 1983.

    Google Scholar 

  6. J.Y. Halpern and Y. Shoham. A Propositional Modal Logic of Time Intervals. Journal of the ACM, 38(4):935–962, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. M.R. Hansen and Zhou Chaochen. Duration Calculus: Logical Foundations. Formal Aspects of Computing, 9(3):283–330, 1997.

    Article  MATH  Google Scholar 

  8. S.T. Heilmann. Proof Support for Duration Calculus. PhD thesis, Dept. of Information Technology, Technical University of Denmark, January 1999.

    Google Scholar 

  9. H.R. Lewis. A Logic of Concrete Time Intervals. In LICS’90, pages 380–389. IEEE, 1990.

    Google Scholar 

  10. B. Moszkowski. A Temporal Logic for Multilevel Reasoning about Hardware. IEEE Computer, 18(2):10–19, 1985.

    Google Scholar 

  11. B. Moszkowski. Compositional Reasoning about Projected and Infinite Time. In Engineering of Complex Computer Systems, pages 238–245. IEEE, 1995.

    Google Scholar 

  12. L.C. Paulson. Isabelle, A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.

    MATH  Google Scholar 

  13. A. Pnueli. Temporal Logic of Programs. In LICS’77, pages 46–57. IEEE, 1977.

    Google Scholar 

  14. Y.S. Ramakrishna, P.M. Melliar-Smith, L.E. Moser, L.K. Dillon, and G. Kutty. Interval logics and their decision procedures. Part I: An interval logic. Theoretical Computer Science, 166(1–2):1–47, 1996.

    MATH  MathSciNet  Google Scholar 

  15. T.M. Rasmussen. Labelled Natural Deduction for Interval Logics. In CSL’01, volume 2142 of LNCS, pages 308–323. Springer, 2001.

    Google Scholar 

  16. T.M. Rasmussen. Signed Interval Logic. In CSL’99, volume 1683 of LNCS, pages 157–171. Springer, 1999.

    Google Scholar 

  17. T.M. Rasmussen. A Sequent Calculus for Signed Interval Logic. Technical Report IMM-TR-2001-06, IMM, Technical University of Denmark, 2001.

    Google Scholar 

  18. J.U. Skakkebæk. A Verification Assistant for a Real-Time Logic. PhD thesis, Dept. of Computer Science, Technical University of Denmark, November 1994.

    Google Scholar 

  19. J.U. Skakkebæk. Liveness and Fairness in Duration Calculus. In CONCUR’94, volume 836 of LNCS, pages 283–298. Springer, 1994.

    Google Scholar 

  20. A. Tarski. On the Calculus of Relations. Journal of Symbolic Logic, 6(3):73–89, 1941.

    Article  MATH  MathSciNet  Google Scholar 

  21. Y. Venema. A Modal Logic for Chopping Intervals. Journal of Logic and Computation, 1(4):453–476, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  22. L. Viganó. Labelled Non-Classical Logics. Kluwer, 2000.

    Google Scholar 

  23. Zheng Yuhua and Zhou Chaochen. A Formal Proof of the Deadline Driven Scheduler. In FTRTFT’94, volume 863 of LNCS, pages 756–775. Springer, 1994.

    Google Scholar 

  24. Zhou Chaochen and M.R. Hansen. An Adequate First Order Interval Logic. In COMPOS’97, volume 1536 of LNCS, pages 584–608. Springer, 1998.

    Google Scholar 

  25. Zhou Chaochen, C.A.R. Hoare, and A.P. Ravn. A Calculus of Durations. Information Processing Letters, 40(5):269–276, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatics and Mathematical Modeling, Technical University of Denmark, Building 321, 2800, Kgs. Lyngby, DK, Denmark

    Thomas Marthedal Rasmussen

Authors
  1. Thomas Marthedal Rasmussen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software, Technical University of Catalonia, Jordi Girona 1, 08034, Barcelona, Spain

    Robert Nieuwenhuis

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rasmussen, T.M. (2001). Automated Proof Support for Interval Logics. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45653-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42957-9

  • Online ISBN: 978-3-540-45653-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation