Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Roman Kniazev

dblp:344/2113 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0006-7495-9793ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › meta-logic
axiomatization
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023
Logic in computer science › epistemic logic
distributed knowledge
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023
Logic in computer science
epistemic logic
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023
Logic in computer science › modal logic › possible-world semantics
kripke structures
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023
Logic in computer science
modal logic
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023
Logic in computer science
sound and complete logical system
0.712023
Semi-Simplicial Set Models for Distributed Knowledge · LICS 2023

Methods — techniques the papers use, named apart from their topics

topology · 0.7simplicial complexes · 0.7
YearPublicationVenuePosition
2024 A Many-Sorted Epistemic Logic for Chromatic Hypergraphs
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.
Eric Goubault, Roman Kniazev, Jérémy Ledent
CSL2
2023 Semi-Simplicial Set Models for Distributed Knowledge
abstract
In recent years, a new class of models for multi-agent epistemic logic has emerged, based on simplicial complexes. Since then, many variants of these simplicial models have been investigated, giving rise to different logics and axiomatizations. In this paper, we present a further generalization, which encompasses all previously studied variants of simplicial models. Geometrically, this is achieved by generalizing beyond simplicial complexes, and considering instead semi-simplicial sets. By doing so, we define a new semantics for epistemic logic with distributed knowledge, where a group of agents may distinguish two worlds, even though each individual agent in the group is unable to distinguish them. As it turns out, these models are the geometric counterpart of a generalization of Kripke models, called "pseudo-models". We show how to recover the previously defined variants of simplicial models as sub-classes of our models; and give a sound and complete axiomatization for each of them.
Eric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum
LICS2