Skip to main content
SpringerLink
Log in

Modal and Justification Logics for Multi-agent Systems (Invited Talk)

  • Conference paper
  • First Online:
Logic and Argumentation (CLAR 2023)

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

Included in the following conference series:

  • 192 Accesses

Abstract

Epistemic modal logic is an important tool in the area of distributed and multi-agent systems.

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 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. Artemov, S.: Explicit provability and constructive semantics. Bull. Symbolic Logic 7(1), 1–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Artemov, S.: The logic of justification. Rev. Symbolic Logic 1(4), 477–513 (2008). https://doi.org/10.1017/S1755020308090060

    Article  MathSciNet  MATH  Google Scholar 

  3. Artemov, S.N., Fitting, M.: Justification Logic: Reasoning with Reasons. Cambridge University Press, Cambridge (2019)

    Book  MATH  Google Scholar 

  4. Babai, L.: Trading group theory for randomness. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing. pp. 421–429. STOC 1985, Association for Computing Machinery (1985). https://doi.org/10.1145/22145.22192

  5. Brünnler, K., Flumini, D., Studer, T.: A logic of blockchain updates. J. Log. Comput. 30(8), 1469–1485 (2020). https://doi.org/10.1093/logcom/exaa045

    Article  MathSciNet  MATH  Google Scholar 

  6. Bucheli, S., Kuznets, R., Studer, T.: Justifications for common knowledge. J. Appl. Non-Class. Logics 21(1), 35–60 (2011). https://doi.org/10.3166/JANCL.21.35-60

  7. Cachin, C., Lehnherr, D., Studer, T.: Synergistic knowledge (submitted)

    Google Scholar 

  8. Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65–75 (1988). https://doi.org/10.1007/BF00206326

    Article  MathSciNet  MATH  Google Scholar 

  9. van Ditmarsch, H., Goubault, É., Ledent, J., Rajsbaum, S.: Knowledge and simplicial complexes. In: Lundgren, B., Nuñez Hernández, N.A. (eds.) Philosophy of Computing, pp. 1–50. Springer International Publishing, Cham (2022). https://doi.org/10.1007/978-3-030-75267-5_1

    Chapter  Google Scholar 

  10. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995). https://doi.org/10.7551/mitpress/5803.001.0001

  11. Faroldi, F.L.G., Ghari, M., Lehmann, E., Studer, T.: Consistency and permission in deontic justification logic. J. Log. Comput. (2022). https://doi.org/10.1093/logcom/exac045

    Article  MATH  Google Scholar 

  12. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing. STOC 1985, pp. 291–304. Association for Computing Machinery (1985). https://doi.org/10.1145/22145.22178

  13. Goubault, É., Ledent, J., Rajsbaum, S.: A simplicial complex model for dynamic epistemic logic to study distributed task computability. Inf. Comput. 278, 104597 (2021). https://doi.org/10.1016/j.ic.2020.104597

    Article  MathSciNet  MATH  Google Scholar 

  14. Goubault, É.G., Kniazev, R., Ledent, J., Rajsbaum, S.: Semi-simplicial set models for distributed knowledge (2023)

    Google Scholar 

  15. Halpern, J.H., Pass, R.: A knowledge-based analysis of the blockchain protocol. In: Lang, K. (ed.) TARK 2017, pp. 324–335, no. 251 in EPTCS (2017). https://doi.org/10.4204/EPTCS.251.22

  16. Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124–149 (1991). https://doi.org/10.1145/114005.102808

    Article  Google Scholar 

  17. Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2013). https://store.elsevier.com/product.jsp?isbn=9780124045781

  18. Kuznets, R., Studer, T.: Logics of Proofs and Justifications. College Publications, Norcross (2019)

    MATH  Google Scholar 

  19. Lehmann, E., Studer, T.: Subset models for justification logic. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 433–449. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-662-59533-6_26

    Chapter  MATH  Google Scholar 

  20. Lehnherr, D., Ognjanović, Z., Studer, T.: A logic of interactive proofs. J. Log. Comput. 32(8), 1645–1658 (2022). https://doi.org/10.1093/logcom/exac071

    Article  MathSciNet  MATH  Google Scholar 

  21. Marinković, B., Glavan, P., Ognjanović, Z., Studer, T.: A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. J. Log. Comput. 29(5), 803–830 (2019). https://doi.org/10.1093/logcom/exz007

    Article  MathSciNet  MATH  Google Scholar 

  22. Xu, C., Wang, Y., Studer, T.: A logic of knowing why. Synthese 198, 1259–1285 (2021)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Bern, Bern, Switzerland

    Christian Cachin, David Lehnherr & Thomas Studer

Authors
  1. Christian Cachin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Lehnherr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Studer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Studer .

Editor information

Editors and Affiliations

  1. IRIT CNRS, Toulouse, France

    Andreas Herzig

  2. Zhejiang University, Hangzhou, China

    Jieting Luo

  3. University of Luxembourg, Esch-sur-Alzette, Luxembourg

    Pere Pardo

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cachin, C., Lehnherr, D., Studer, T. (2023). Modal and Justification Logics for Multi-agent Systems (Invited Talk). In: Herzig, A., Luo, J., Pardo, P. (eds) Logic and Argumentation. CLAR 2023. Lecture Notes in Computer Science(), vol 14156. Springer, Cham. https://doi.org/10.1007/978-3-031-40875-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40875-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40874-8

  • Online ISBN: 978-3-031-40875-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation