Skip to main content
SpringerLink
Log in

Tableau Calculi for Hybrid Logics

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1999)

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

Abstract

Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quantifiers to bind the labels. Thus, hybrid logics have both Kripke semantics and a first-order binding apparatus. We present prefixed tableau calculi for weak hybrid logics (proper fragments of classical logic) as well as for hybrid logics having full first-order expressive power, and give a general method for proving completeness. For the weak quantifier-free logics we present a tableau-based decision procedure.

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 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. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217–274, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Blackburn. Internalizing labeled deduction. Manuscript, 1998.

    Google Scholar 

  3. P. Blackburn and J. Seligman. Hybrid languages. Journal of Logic, Language and Information, 4:251–272, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Blackburn and J. Seligman. What are hybrid languages? In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, vol. 1, pages 41–62. CSLI Publications, Stanford University, 1998.

    Google Scholar 

  5. P. Blackburn and M. Tzakova. Hybrid completeness. Logic Journal of the IGPL, 6(4):625–650, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Blackburn and M. Tzakova. Hybridizing concept languages. Annals of Mathematics and Artificial Intelligence, 24(1–4):23–49, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  7. P. Blackburn and M. Tzakova. Hybrid languages and temporal logic. Logic Journal of the IGPL, 7(1):27–54, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Bull. An approach to tense logic. Theoria, 36:282–300, 1970.

    Article  MathSciNet  Google Scholar 

  9. M. D’Agostino, D. Gabbay, R. Hähnle, and J. Possega, editors. Handbook of Tableau Methods. Kluwer, Dordrecht, 1998. To appear.

    Google Scholar 

  10. M. Fitting. Proof methods for modal and intuitionistic logic. Synthese Library. Reidel, Dordrecht, 1983.

    Google Scholar 

  11. G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22(6):607–636, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. V. Goranko. Hierarchies of modal and temporal logics with reference pointers. Journal of Logic, Language and Information, 5(1):1–24, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Goré. Tableau methods for modal and temporal logics. Technical Report TRARP-15-95, ARP, Australian National University, 1995.

    Google Scholar 

  14. S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and Computation, 93:263–332, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Prior. Past, present and future. Oxford University Press, Oxford, 1967.

    MATH  Google Scholar 

  16. W. Rautenberg. Modal tableau calculi and interpolation. Journal of Philosophical Logic Vol. 12 No. 4, 12(4):403–424, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Seligman. A cut-free sequent calculus for elementary situated reasoning. Technical Report HCRC-RP 22, HCRC, University of Edinburgh, 1991.

    Google Scholar 

  18. J. Seligman. The logic of correct description. In M. de Rijke, editor, Advances in Intensional Logic, Applied Logic Series. Kluwer, Dordrecht, 1997.

    Google Scholar 

  19. R. M. Smullyan. First-order logic. Dover Publications, New York, 2nd edition, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Miroslava Tzakova

Authors
  1. Miroslava Tzakova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Institute for Programming and Logics, University at Albany - SUNY, Albany, NY, 12222, USA

    Neil V. Murray

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Heidelberg Berlin

About this paper

Cite this paper

Tzakova, M. (1999). Tableau Calculi for Hybrid Logics. In: Murray, N.V. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1999. Lecture Notes in Computer Science(), vol 1617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48754-9_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-48754-9_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48754-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation