Skip to main content

Discrete Linear Temporal Logic with Knowing-Value Operator

  • Conference paper
  • First Online:
Logic, Rationality, and Interaction (LORI 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13039))

Included in the following conference series:

  • 517 Accesses

Abstract

In epistemic logic we are not only interested in the propositional knowledge expressed by “knowing that” operators, but also care about other types of knowledge used in natural language. In [1], Plaza proposed the “knowing value” operators and gave the complete axiomatization for the logic of knowledge with nonrigid designators. Moreover, in [2] Halpern and colleagues holds that, when analyzing a system in terms of knowledge, not only is the current state of knowledge of the agents in the system relevant, but also how that state of knowledge changes over time. So we introduce temporal logic operators ‘next’ and ‘until’ to extend Plaza’s system. The completeness proof is highly non-trivial and we referred to the work of [2, 3].

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

References

  1. Plaza, J.: Logics of Public Communications. Synthese, Dordrecht (2007)

    Book  Google Scholar 

  2. Halpern, J.Y., Van Der Meyden, R., Vardi, M.Y.: Complete axiomatizations for reasoning about knowledge and time. Siam J. Comput. 33, 674–703 (2004)

    Article  Google Scholar 

  3. Wang, Y., Fan, J.: Conditionally knowing what (2014)

    Google Scholar 

  4. Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. I. Lower bounds. J. Comput. Syst. Sci. 38, 195–237 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaiyang Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, K. (2021). Discrete Linear Temporal Logic with Knowing-Value Operator. In: Ghosh, S., Icard, T. (eds) Logic, Rationality, and Interaction. LORI 2021. Lecture Notes in Computer Science(), vol 13039. Springer, Cham. https://doi.org/10.1007/978-3-030-88708-7_11

Download citation

Publish with us

Policies and ethics