DROPS

Document

DOI: 10.4230/LIPIcs.ITP.2024.28

Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge

Authors: Kai Obendrauf, Anne Baanen, Patrick Koopmann, and Vera Stebletsova

Published in: LIPIcs, Volume 309, 15th International Conference on Interactive Theorem Proving (ITP 2024)

Abstract

Coalition Logic (CL) is a well-known formalism for reasoning about the strategic abilities of groups of agents in multi-agent systems. Coalition Logic with Common Knowledge (CLC) extends CL with operators from epistic logics, and thus with the ability to model the individual and common knowledge of agents. We have formalized the syntax and semantics of both logics in the interactive theorem prover Lean 4, and used it to prove soundness and completeness of its axiomatization. Our formalization uses the type class system to generalize over different aspects of CLC, thus allowing us to reuse some of to prove properties in related logics such as CL and CLK (CL with individual knowledge).

Cite as

Kai Obendrauf, Anne Baanen, Patrick Koopmann, and Vera Stebletsova. Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge. In 15th International Conference on Interactive Theorem Proving (ITP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 309, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{obendrauf_et_al:LIPIcs.ITP.2024.28,
  author =	{Obendrauf, Kai and Baanen, Anne and Koopmann, Patrick and Stebletsova, Vera},
  title =	{{Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge}},
  booktitle =	{15th International Conference on Interactive Theorem Proving (ITP 2024)},
  pages =	{28:1--28:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-337-9},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{309},
  editor =	{Bertot, Yves and Kutsia, Temur and Norrish, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2024.28},
  URN =		{urn:nbn:de:0030-drops-207560},
  doi =		{10.4230/LIPIcs.ITP.2024.28},
  annote =	{Keywords: Multi-agent systems, Coalition Logic, Epistemic Logic, common knowledge, completeness, formal methods, Lean prover}
}

Search Results

Documents authored by Obendrauf, Kai

Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge

Abstract

Cite as

Thanks for your feedback!

Could not send message