English
Related papers

Related papers: Bisimulation for Impure Simplicial Complexes

200 papers

Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many…

Logic in Computer Science · Computer Science 2025-12-01 Yuanzhe Yang

In recent years, several authors have been investigating simplicial models, a model of epistemic logic based on higher-dimensional structures called simplicial complexes. In the original formulation, simplicial models were always assumed to…

Logic in Computer Science · Computer Science 2023-11-15 Eric Goubault , Roman Kniazev , Jeremy Ledent , Sergio Rajsbaum

Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…

Logic in Computer Science · Computer Science 2024-02-14 Rojo Randrianomentsoa , Hans van Ditmarsch , Roman Kuznets

We propose a logic of knowledge for impure simplicial complexes. Impure simplicial complexes represent synchronous distributed systems under uncertainty over which processes are still active (are alive) and which processes have failed or…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-04-21 Hans van Ditmarsch , Roman Kuznets

Simplicial complexes are a convenient semantic primitive to reason about processes (agents) communicating with each other in synchronous and asynchronous computation. Impure simplicial complexes distinguish active processes from crashed…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-03 Hans van Ditmarsch , Roman Kuznets , Rojo Randrianomentsoa

The standard semantics of multi-agent epistemic logic S5 is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional structure contains implicit higher-dimensional information beyond…

Logic in Computer Science · Computer Science 2022-11-10 Éric Goubault , Jérémy Ledent , Sergio Rajsbaum

Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…

Logic in Computer Science · Computer Science 2015-03-13 Lorenz Demey

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…

Artificial Intelligence · Computer Science 2018-02-06 Mikkel Birkegaard Andersen , Thomas Bolander , Hans van Ditmarsch , Martin Holm Jensen

In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy…

Logic · Mathematics 2025-02-17 Marko Stanković , Miroslav Ćirić , Jelena Ignjatović

We give Hennessy-Milner classes for intuitionistic, dual-intuitionistic and bi-intuitionistic logic interpreted in intuitionistic Kripke models, and generalise these results to modal (dual- and bi-)intuitionistic logics. Our main technical…

Logic · Mathematics 2021-05-06 Jim de Groot , Dirk Pattinson

Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge, on the assumption that initial epistemic models can be described in a distributed fashion. Thus, we can…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-06 Hans van Ditmarsch , Eric Goubault , Jeremy Ledent , Sergio Rajsbaum

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…

Physics and Society · Physics 2021-12-07 Andrea Mock , Ismar Volic

We study comparisons between interpretations in description logics with respect to "logical consequences" of the form of semi-positive concepts (like semi-positive concept assertions). Such comparisons are characterized by conditions…

Logic in Computer Science · Computer Science 2013-04-23 Ali Rezaei Divroodi , Linh Anh Nguyen

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply…

Commutative Algebra · Mathematics 2014-11-25 Jürgen Herzog , Takayuki Hibi

We introduce a semantics for epistemic logic exploiting a belief base abstraction. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and epistemic alternative are primitive, in the…

Computer Science and Game Theory · Computer Science 2019-07-23 Emiliano Lorini

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

Higher-dimensional automata (HDAs) are models of non-interleaving concurrency for analyzing concurrent systems. There is a rich literature that deals with bisimulations for concurrent systems, and some of them have been extended to HDAs.…

Logic in Computer Science · Computer Science 2026-03-03 Safa Zouari , Krzysztof Ziemiański , Uli Fahrenberg
‹ Prev 1 2 3 10 Next ›