Skip to main content

A General Tableau Method for Propositional Interval Temporal Logics

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2003)

Abstract

Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based temporal logics. In this paper, we introduce a new, very expressive propositional interval temporal logic, called (Non-Strict) Branching CDT (BCDT + ) which extends most of the propositional interval temporal logics proposed in the literature. Then, we provide BCDT +  with a generic tableau method which combines features of explicit tableau methods for modal logics with constraint label management and the classical tableau method for first-order logic, and we prove its soundness and completeness.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bowman, H., Thompson, S.: A decision procedure and complete axiomatization of finite interval temporal logic with projection. Journal of Logic and Computation 13(2), 195–239 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cerrito, S., Cialdea Mayer, M., Praud, S.: First-order linear temporal logic over finite time structures. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705, Springer, Heidelberg (1999)

    Google Scholar 

  3. Chetcuti-Serandio, N., Fariñas del Cerro, L.: A mixed decision method for duration calculus. Journal of Logic and Computation 10, 877–895 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Kluwer, Dordrecht (1999)

    Google Scholar 

  5. Emerson, E.A.: Temporal and modal logic. Handbook of Theoretical Computer Science B, 996–1072 (1990)

    Google Scholar 

  6. Fitting, M.: Proof methods for modal and intuitionistic logics. In: Holland, D. (ed.) Synthese Library, vol. 169. Reidel, Dordrecht (1983)

    Google Scholar 

  7. Grädel, E., Hirsch, C., Otto, M.: Back and forth between guarded and modal logics. ACM Trans. on Computational Logics 3(3), 418–463 (2002)

    Article  Google Scholar 

  8. Goranko, V., Montanari, A., Sciavicco, G.: On propositional interval neighborhood temporal logics. Journal of Universal Computer Science (2003) (to appear)

    Google Scholar 

  9. Halpern, J.Y., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935–962 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kontchakov, R., Lutz, C., Wolter, F., Zakharyashev, M.: Temporalising tableaux (2002) (submitted for publication)

    Google Scholar 

  11. Kono, S.: A combination of clausal and non-clausal temporal logic programs. In: Fisher, M., Owens, R. (eds.) IJCAI-WS 1993. LNCS, vol. 897, pp. 40–57. Springer, Heidelberg (1995)

    Google Scholar 

  12. Moszkowski, B.: Reasoning about Digital Circuits. PhD thesis, Stanford University, Stanford, CA (1983)

    Google Scholar 

  13. Marx, M., Venema, Y.: Multi-Dimensional Modal Logic. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  14. Rautenberg, W.: Modal tableau calculi and interpolation. Journal of Philosophical Logics 12, 403–423 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schmitt, P.H., Goubault-Larrecq, J.: A tableau system for linear-time temporal logic. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 130–144. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. Venema, Y.: A modal logic for chopping intervals. Journal of Logic and Computation 1(4), 453–476 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Wolper, P.: The tableau method for temporal logic: an overview. Logique et Analyse 28(110–111), 119–136 (1985)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goranko, V., Montanari, A., Sciavicco, G. (2003). A General Tableau Method for Propositional Interval Temporal Logics. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45206-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40787-4

  • Online ISBN: 978-3-540-45206-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics