English
Related papers

Related papers: Cayley structures and common knowledge

200 papers

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Logic · Mathematics 2023-05-18 Saeed Salehi

This paper combines the classical model of labeled transition systems with the epistemic model for reasoning about knowledge. The result is a unifying framework for modeling and analyzing multi-agent, knowledge-based, dynamic systems. On…

Artificial Intelligence · Computer Science 2025-12-03 Alessandro Aldini

We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all…

Discrete Mathematics · Computer Science 2007-05-23 David Renault

We ask what happens when the index set carries modal structure, with possibilities organized into a Kripke frame. We define modal exchangeability as invariance under accessibility-preserving automorphisms that fix a designated base world,…

Logic · Mathematics 2026-04-16 Daniel Zantedeschi

It is well-known that if one assumes quantum theory to hold locally, then processes with indefinite causal order and cyclic causal structures become feasible. Here, we study qualitative limitations on causal structures and correlations…

Quantum Physics · Physics 2024-01-09 Eleftherios-Ermis Tselentis , Ämin Baumeler

We propose parametric constructive Kripke-semantics for multi-agent KD45-belief and S5-knowledge in terms of elementary set-theoretic constructions of two basic functional building blocks, namely bias (or viewpoint) and visibility,…

Logic in Computer Science · Computer Science 2012-09-11 Simon Kramer , Joshua Sack

Dynamic Epistemic Logic makes it possible to model and reason about information change in multi-agent systems. Information change is mathematically modeled through epistemic action Kripke models introduced by Baltag et al. Also, van…

Logic in Computer Science · Computer Science 2016-11-26 Mohammad Ardeshir Rasoul Ramezanian

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an {\em evidence logic} for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a…

Logic · Mathematics 2013-07-05 Johan van Benthem , David Fernández-Duque , Eric Pacuit

In this paper, we deal with the problem of putting together modal worlds that operate in different logic systems. When evaluating a modal sentence $\Box \varphi$, we argue that it is not sufficient to inspect the truth of $\varphi$ in…

Logic · Mathematics 2022-03-02 Alfredo Roque Freire , Manuel A. Martins

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

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

The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…

Artificial Intelligence · Computer Science 2011-05-30 D. Calvanese , M. Lenzerini , D. Nardi

Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the…

Logic in Computer Science · Computer Science 2015-07-01 Helle Hvid Hansen , Clemens Kupke , Eric Pacuit

We introduce a modal logic for describing statistical knowledge, which we call statistical epistemic logic. We propose a Kripke model dealing with probability distributions and stochastic assignments, and show a stochastic semantics for the…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

In domains with high knowledge distribution a natural objective is to create principle foundations for collaborative interactive learning environments. We present a first mathematical characterization of a collaborative learning group, a…

Artificial Intelligence · Computer Science 2020-08-26 Tom Hanika , Jens Zumbrägel

Barring swarm robotics, a substantial share of current machine-human and machine-machine learning and interaction mechanisms are being developed and fed by results of agent-based computer simulations, game-theoretic models, or robotic…

Artificial Intelligence · Computer Science 2012-08-24 Michał B. Paradowski , Łukasz Jonak

In studies of bundled modalities, we encode a complex conceptual notion into the semantics of a single modal operator and study its logic. Although there is already a substantial body of work on various concrete bundled operators, we still…

Logic in Computer Science · Computer Science 2026-03-30 Yifeng Ding , Yuanzhe Yang

Common knowledge/belief in rationality is the traditional standard assumption in analysing interaction among agents. This paper proposes a graph-based language for capturing significantly more complicated structures of higher-order beliefs…

Artificial Intelligence · Computer Science 2024-12-13 Qi Shi , Pavel Naumov

Complex networks have been found to provide a good representation of the structure of knowledge, as understood in terms of discoverable concepts and their relationships. In this context, the discovery process can be modeled as agents…

Social and Information Networks · Computer Science 2017-09-07 Henrique F. de Arruda , Filipi N. Silva , Luciano da F. Costa , Diego R. Amancio

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…

Logic in Computer Science · Computer Science 2011-01-18 Lutz Schröder , Dirk Pattinson
‹ Prev 1 3 4 5 6 7 10 Next ›