A many-sorted epistemic logic for chromatic hypergraphs

Eric Goubault, Roman Kniazev, Jérémy Ledent
8/1/2023
cs.LOcs.MAmath.LO

No confident code implementation found for this paper.

Abstract

We propose a many-sorted modal logic for reasoning about knowledge in multi-agent systems. Our logic introduces a clear distinction between participating agents and the environment. This allows to express local properties of agents and global properties of worlds in a uniform way, as well as to talk about the presence or absence of agents in a world. The logic subsumes the standard epistemic logic and is a conservative extension of it. The semantics is given in chromatic hypergraphs, a generalization of chromatic simplicial complexes, which were recently used to model knowledge in distributed systems. We show that the logic is sound and complete with respect to the intended semantics. We also show a further connection of chromatic hypergraphs with neighborhood frames.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{goubault2023manysorted,
  title  = {A many-sorted epistemic logic for chromatic hypergraphs},
  author = {Eric Goubault and Roman Kniazev and Jérémy Ledent},
  year   = {2023},
  eprint = {2308.00477},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.00477v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.00477.svg)](https://codeofpaper.com/paper/2308.00477)

Discussion