Skip to main content

Knowledge over Dense Flows of Time (from a Hybrid Point of View)

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2556))

Abstract

This paper is about an application of hybrid logic to the following problem with reasoning about knowledge: how to axiomatize spaces of knowledge states over dense flows of time? We provide an answer to this question below, proving a corresponding completeness theorem. We will make essential use of the fact that the hybrid logical language is particularly suited to express, in the modal sense, flrst-order properties of frames.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Patrick Blackburn. Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto. Logic Journal of the IGPL, 8:339–365, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  2. Patrick Blackburn, Maarten de Rijke, and Y de Venema. Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 2001.

    Google Scholar 

  3. Patrick Blackburn and Miroslava Tzakova. Hybrid Languages and Temporal Logic. Logic Journal of the IGPL, 7(1):27–54, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. Andrew Dabrowski, Lawrence S. Moss, and Rohit Parikh. Topological Reasoning and The Logic of Knowledge. Annals of Pure and Applied Logic, 78:73–110, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 1995.

    MATH  Google Scholar 

  6. Konstantinos Georgatos. Knowledge on Treelike Spaces. Studia Logica, 59:271–301, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bernhard Heinemann. On Sets Growing Continuously. In C. Pandu Rangan, V. Raman, and R. Ramanujam, editors, Foundations of Software Technology & Theoretical Computer Science, 19th Conference, FST&TCS 1999, volume 1738 of Lecture Notes in Computer Science, pages 420–431, Berlin, 1999. Springer.

    Google Scholar 

  8. Bernhard Heinemann. Modelling Change with the Aid of Knowledge and Time. In R. Freivalds, editor, Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, volume 2138 of Lecture Notes in Computer Science, pages 150–161, Berlin, 2001. Springer.

    Google Scholar 

  9. Bernhard Heinemann. A Hybrid Treatment of Evolutionary Sets. In C. A. Coello Coello, A. de Albornoz, L. E. Sucar, and O. Cairó Battistutti, editors, MICAI’2002: Advances in Artificial Intelligence, volume 2313 of Lecture Notes in Artificial Intelligence, pages 204–213, Berlin, 2002. Springer.

    Google Scholar 

  10. Bernhard Heinemann. Linear Tense Logics of Increasing Sets. Journal of Logic and Computation, 12(4):583–606, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  11. Jaakko Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, NY, 1962.

    Google Scholar 

  12. Ian Hodkinson, Frank Wolter, and Michael Zakharyaschev. Decidable Fragments of First-Order Temporal Logics. Annals of Pure and Applied Logic, 106(1–3):85–134, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  13. J.-J.Ch. Meyer and W. van der Hoek. Epsitemic Logic for AI and Computer Science, volume 41 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1995.

    Google Scholar 

  14. Lawrence S. Moss and Rohit Parikh. Topological Reasoning and The Logic of Knowledge. In Y. Moses, editor, Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge (TARK 1992), pages 95–105, San Francisco, CA, 1992. Morgan Kaufmann.

    Google Scholar 

  15. M. Angela Weiss and Rohit Parikh. Completeness of Certain Bimodal Logics for Subset Spaces. Studia Logica, 71:1–30, 2002.

    Article  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

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heinemann, B. (2002). Knowledge over Dense Flows of Time (from a Hybrid Point of View). In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-36206-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00225-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics