Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Automated Reasoning

IJCAR 2010: Automated Reasoning pp 240–254Cite as

Terminating Tableaux for Hybrid Logic with Eventualities

  • Conference paper

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

Abstract

We present the first terminating tableau system for hybrid logic with eventualities. The system is designed as a basis for gracefully degrading reasoners. Eventualities are formulas of the form \(\Diamond^*s\) that hold for a state if it can reach in n ≥ 0 steps a state satisfying the formula s. The system is prefix-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision procedures.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abate, P., Goré, R., Widmann, F.: An on-the-fly tableau-based decision procedure for PDL-satisfiability. In: Areces, C., Demri, S. (eds.) M4M-5. ENTCS, vol. 231, pp. 191–209. Elsevier, Amsterdam (2009)

    Google Scholar 

  2. Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, pp. 821–868. Elsevier, Amsterdam (2007)

    Chapter  Google Scholar 

  3. Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. DFKI Research Report RR-90-13, Deutsches Forschungszentrum für Künstliche Intelligenz, Kaiserslautern, Germany (1990)

    Google Scholar 

  4. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  5. Bolander, T., Blackburn, P.: Termination for hybrid tableaus. J. Log. Comput. 17(3), 517–554 (2007)

    Article  MathSciNet  Google Scholar 

  6. Bolander, T., Braüner, T.: Tableau-based decision procedures for hybrid logic. J. Log. Comput. 16(6), 737–763 (2006)

    Article  MathSciNet  Google Scholar 

  7. De Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for converse-PDL. Inf. Comput. 162(1-2), 117–137 (2000)

    Article  MathSciNet  Google Scholar 

  8. Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Programming 2(3), 241–266 (1982)

    Article  Google Scholar 

  9. Emerson, E.A., Halpern, J.Y.: “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. J. ACM 33(1), 151–178 (1986)

    Article  MathSciNet  Google Scholar 

  10. Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. System Sci., 194–211 (1979)

    Google Scholar 

  11. Goré, R., Widmann, F.: An optimal on-the-fly tableau-based decision procedure for PDL-satisfiability. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol. 5663, pp. 437–452. Springer, Heidelberg (2009)

    Google Scholar 

  12. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)

    Book  Google Scholar 

  13. Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal{SHOIQ}\). J. Autom. Reasoning 39(3), 249–276 (2007)

    Article  MathSciNet  Google Scholar 

  14. Kaminski, M., Smolka, G.: Terminating tableaux for hybrid logic with the difference modality and converse. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 210–225. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Kaminski, M., Smolka, G.: Terminating tableau systems for hybrid logic with difference and converse. J. Log. Lang. Inf. 18(4), 437–464 (2009)

    Article  MathSciNet  Google Scholar 

  16. Pnueli, A.: The temporal logic of programs. In: FOCS’77, pp. 46–57. IEEE Computer Society Press, Los Alamitos (1977)

    Google Scholar 

  17. Pratt, V.R.: A near-optimal method for reasoning about action. J. Comput. System Sci. 20(2), 231–254 (1980)

    Article  MathSciNet  Google Scholar 

  18. Sattler, U., Vardi, M.Y.: The hybrid μ-calculus. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 76–91. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Schneider, S.: Terminating Tableaux for Modal Logic with Transitive Closure. Bachelor’s thesis, Saarland University (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saarland University, Saarbrücken, Germany

    Mark Kaminski & Gert Smolka

Authors
  1. Mark Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gert Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, LuFG Informatik, 2, Ahornstr. 55, 52074, Aachen, Germany

    Jürgen Giesl

  2. Department of Computer Science, Chalmers University of Technology, 41296, Gothenburg, Sweden

    Reiner Hähnle

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaminski, M., Smolka, G. (2010). Terminating Tableaux for Hybrid Logic with Eventualities. In: Giesl, J., Hähnle, R. (eds) Automated Reasoning. IJCAR 2010. Lecture Notes in Computer Science(), vol 6173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14203-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14203-1_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14202-4

  • Online ISBN: 978-3-642-14203-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation