Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge
Year: 2024
Type: conference-paper
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).
Source: VU Research Portal
Authors: Obendrauf, Kai, Baanen, Anne; id_orcid 0000-0001-8497-3683, Koopmann, Patrick; id_orcid 0000-0001-5999-2583, Stebletsova, Vera
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7110780257