Skip to main content

Modelling Change with the Aid of Knowledge and Time

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

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

Included in the following conference series:

Abstract

This paper is about a formalism describing the change of a given set in the course of time. Starting at the Halpern-Moses semantics of evolving knowledge in distributed systems and restricting attention to synchronous ones, then the knowledge state of an agent having a part in the system represents a paradigm for such a changing set, and also a guide to our modelling attempt. We develop an appropiate language of change and axiomatize the set of theorems of a corresponding logic. Afterwards, we are concerned with the basic properties of the resulting system: semantic completeness, decidability, and complexity. It turns out that simplicity of the facts is reflected as simplicity of the system, in a sense.

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. Girish Bhat and Doron Peled. Adding Partial Orders to Linear Temporal Logic. Fundamenta Informaticae, 36:1–21, 1998.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal Logic. Forthcoming (preprint web-available).

    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. Clare Dixon and Michael Fisher. Clausal Resolution for Logics of Time and Knowledge with Synchrony and Perfect Recall. In International Conference on Temporal Logic 2000, pages 43–52, Leipzig, October 2000. University of Leipzig.

    Google Scholar 

  6. Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge (Mass.), 1995.

    MATH  Google Scholar 

  7. Dov M. Gabbay, Ian Hodkinson, and Mark Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, volume 28 of Oxford Logic Guides. Clarendon Press, Oxford, 1994.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Robert Goldblatt. Logics of Time and Computation, volume 7 of CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, second edition, 1992.

    Google Scholar 

  10. Joseph Y. Halpern and Yoram Moses. Knowledge and Common Knowledge in a Distributed Environment. Journal of the ACM, 37:549–587, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  11. Joseph Y. Halpern, Ron van der Meyden, and Moshe Y. Vardi. Complete Axiomatizations for Reasoning about Knowledge and Time. Preprint (web-available), 1997.

    Google Scholar 

  12. Joseph Y. Halpern and Moshe Y. Vardi. The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds. Journal of Computer and System Sciences, 38:195–237, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  13. Bernhard Heinemann. Temporal Aspects of the Modal Logic of Subset Spaces. Theoretical Computer Science, 224(1–2):135–155, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  14. Bernhard Heinemann. Extending Topological Nexttime Logic. In S. D. Goodwin and A. Trudel, editors, Temporal Representation and Reasoning, 7th International Workshop, TIME-00, pages 87–94, Los Alamitos, Ca., 2000. IEEE Computer Society Press.

    Google Scholar 

  15. Bernhard Heinemann. Generalizing the Modal and Temporal Logic of Linear Time. In T. Rus, editor, Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, volume 1816 of Lecture Notes in Computer Science, pages 41–56. Springer, 2000.

    Chapter  Google Scholar 

  16. Jaakko Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, N.Y., 1977. 5th Printing.

    Google Scholar 

  17. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, New York, 1991.

    MATH  Google Scholar 

  18. Zohar Manna and Amir Pnueli. Temporal Verification of Reactive Systems. Springer, New York, 1995.

    Google Scholar 

  19. A. Prasad Sistla and Edmund M. Clarke. The Complexity of Propositional Linear Temporal Logics. Journal of the ACM, 32:733–749, 1985.

    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

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heinemann, B. (2001). Modelling Change with the Aid of Knowledge and Time. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics