Simplicial Models for the Epistemic Logic of Faulty Agents
- URL: http://arxiv.org/abs/2311.01351v3
- Date: Tue, 14 Nov 2023 11:23:59 GMT
- Title: Simplicial Models for the Epistemic Logic of Faulty Agents
- Authors: Eric Goubault, Roman Kniazev, Jeremy Ledent, Sergio Rajsbaum
- Abstract summary: We show that subtle design choices in the definition of impure simplicial models can result in different axioms of the resulting logic.
We illustrate them via distributed computing examples of synchronous systems where processes may crash.
- Score: 1.474723404975345
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 be pure, meaning that all worlds have the same dimension.
This is equivalent to the standard S5n semantics of epistemic logic, based on
Kripke models. By removing the assumption that models must be pure, we can go
beyond the usual Kripke semantics and study epistemic logics where the number
of agents participating in a world can vary. This approach has been developed
in a number of papers, with applications in fault-tolerant distributed
computing where processes may crash during the execution of a system. A
difficulty that arises is that subtle design choices in the definition of
impure simplicial models can result in different axioms of the resulting logic.
In this paper, we classify those design choices systematically, and axiomatize
the corresponding logics. We illustrate them via distributed computing examples
of synchronous systems where processes may crash.
Related papers
- The Theory of the Unique Latent Pattern: A Formal Epistemic Framework for Structural Singularity in Complex Systems [2.44755919161855]
This paper introduces the Theory of the Unique Latent Pattern (ULP), a formal framework that redefines the origin of apparent complexity in dynamic systems.<n>Rather than attributing unpredictability to intrinsic randomness or emergent nonlinearity, ULP asserts that every analyzable system is governed by a structurally unique, deterministic generative mechanism.
arXiv Detail & Related papers (2025-05-24T19:52:28Z) - Inference of Abstraction for Grounded Predicate Logic [0.0]
An important open question in AI is what simple and natural principle enables a machine to reason logically for meaningful abstraction with grounded symbols.
This paper explores a conceptually new approach to combining probabilistic reasoning and predicative symbolic reasoning over data.
arXiv Detail & Related papers (2025-02-19T14:07:34Z) - No Equations Needed: Learning System Dynamics Without Relying on Closed-Form ODEs [56.78271181959529]
This paper proposes a conceptual shift to modeling low-dimensional dynamical systems by departing from the traditional two-step modeling process.
Instead of first discovering a closed-form equation and then analyzing it, our approach, direct semantic modeling, predicts the semantic representation of the dynamical system.
Our approach not only simplifies the modeling pipeline but also enhances the transparency and flexibility of the resulting models.
arXiv Detail & Related papers (2025-01-30T18:36:48Z) - Identification and Estimation of Simultaneous Equation Models Using Higher-Order Cumulant Restrictions [9.10992754495906]
Identifying structural parameters in linear simultaneous equation models is a fundamental challenge in economics and related fields.
We show that under any diagonal higher-cumulant condition, the structural parameter matrix can be identified by solving an eigenvector problem.
Our framework offers a transparent way to test for it, all within the same higher-orderity setting employed by earlier studies.
arXiv Detail & Related papers (2025-01-12T11:27:39Z) - Algorithmic syntactic causal identification [0.8901073744693314]
Causal identification in causal Bayes nets (CBNs) is an important tool in causal inference.
Most existing formulations of causal identification using techniques such as d-separation and do-calculus are expressed within the mathematical language of classical probability theory.
We show that this restriction can be lifted by replacing the use of classical probability theory with the alternative axiomatic foundation of symmetric monoidal categories.
arXiv Detail & Related papers (2024-03-14T17:14:53Z) - LOGICSEG: Parsing Visual Semantics with Neural Logic Learning and
Reasoning [73.98142349171552]
LOGICSEG is a holistic visual semantic that integrates neural inductive learning and logic reasoning with both rich data and symbolic knowledge.
During fuzzy logic-based continuous relaxation, logical formulae are grounded onto data and neural computational graphs, hence enabling logic-induced network training.
These designs together make LOGICSEG a general and compact neural-logic machine that is readily integrated into existing segmentation models.
arXiv Detail & Related papers (2023-09-24T05:43:19Z) - A Hybrid System for Systematic Generalization in Simple Arithmetic
Problems [70.91780996370326]
We propose a hybrid system capable of solving arithmetic problems that require compositional and systematic reasoning over sequences of symbols.
We show that the proposed system can accurately solve nested arithmetical expressions even when trained only on a subset including the simplest cases.
arXiv Detail & Related papers (2023-06-29T18:35:41Z) - MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios.
Based on the multi-hop chain of reasoning, the explanation form includes three main components.
We evaluate the current best models' performance on this new explanation form.
arXiv Detail & Related papers (2022-10-22T16:01:13Z) - Language Models Are Greedy Reasoners: A Systematic Formal Analysis of
Chain-of-Thought [10.524051272257614]
Large language models (LLMs) have shown remarkable reasoning capabilities given chain-of-thought prompts.
We present a new synthetic question-answering dataset called PrOntoQA, where each example is generated as a synthetic world model.
This allows us to parse the generated chain-of-thought into symbolic proofs for formal analysis.
arXiv Detail & Related papers (2022-10-03T21:34:32Z) - Logical Credal Networks [87.25387518070411]
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability.
We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
arXiv Detail & Related papers (2021-09-25T00:00:47Z) - A Simplicial Model for $KB4_n$: Epistemic Logic with Agents that May Die [2.2946354246664558]
This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions.
We extend the theory to encompass all simplicial models - including the ones that are not pure.
arXiv Detail & Related papers (2021-08-23T17:10:13Z) - Conditional independences and causal relations implied by sets of
equations [1.847740135967371]
We make use of Simon's causal ordering algorithm to construct a causal ordering graph.
We prove that it expresses the effects of perfect interventions on the equations under certain unique solvability assumptions.
We discuss how this approach reveals and addresses some of the limitations of existing causal modelling frameworks.
arXiv Detail & Related papers (2020-07-14T17:00:28Z) - Contextuality scenarios arising from networks of stochastic processes [68.8204255655161]
An empirical model is said contextual if its distributions cannot be obtained marginalizing a joint distribution over X.
We present a different and classical source of contextual empirical models: the interaction among many processes.
The statistical behavior of the network in the long run makes the empirical model generically contextual and even strongly contextual.
arXiv Detail & Related papers (2020-06-22T16:57:52Z) - A Critical View of the Structural Causal Model [89.43277111586258]
We show that one can identify the cause and the effect without considering their interaction at all.
We propose a new adversarial training method that mimics the disentangled structure of the causal model.
Our multidimensional method outperforms the literature methods on both synthetic and real world datasets.
arXiv Detail & Related papers (2020-02-23T22:52:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.