Graded Distributed Belief
- URL: http://arxiv.org/abs/2511.22381v1
- Date: Thu, 27 Nov 2025 12:14:28 GMT
- Title: Graded Distributed Belief
- Authors: Emiliano Lorini, Dmitry Rozplokhas,
- Abstract summary: We introduce a new logic of graded distributed belief that allows us to express the fact that a group of agents believe that a certain fact holds with at least strength k.<n>The strength of the group's distributed belief is directly computed from the group's belief base after having merged its members' individual belief bases.
- Score: 11.582752410465227
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce a new logic of graded distributed belief that allows us to express the fact that a group of agents distributively believe that a certain fact holds with at least strength k. We interpret our logic by means of computationally grounded semantics relying on the concept of belief base. The strength of the group's distributed belief is directly computed from the group's belief base after having merged its members' individual belief bases. We illustrate our logic with an intuitive example, formalizing the notion of epistemic disagreement. We also provide a sound and complete Hilbert-style axiomatization, decidability result obtained via filtration, and a tableaux-based decision procedure that allows us to state PSPACE-completeness for our logic.
Related papers
- Virtual Group Knowledge and Group Belief in Topological Evidence Models (Extended Version) [41.99844472131922]
We study notions of (virtual) group knowledge and group belief within multi-agent evidence models.<n>We axiomatize and show the decidability of the logic of "hard" and "soft" group evidence.
arXiv Detail & Related papers (2025-08-29T18:33:54Z) - Toward a Graph-Theoretic Model of Belief: Confidence, Credibility, and Structural Coherence [0.0]
This paper introduces a minimal formalism for belief systems as directed, weighted graphs.<n>Unlike logical and argumentation-based frameworks, it supports fine-grained structural representation without committing to binary justification status or deductive closure.<n>Its aim is to provide a foundational substrate for analyzing the internal organization of belief systems.
arXiv Detail & Related papers (2025-08-05T14:03:23Z) - A Logic of Uncertain Interpretation [0.0]
We introduce a logical framework for reasoning about "uncertain interpretations"<n>We investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment" and a conservative notion of "evidentially supported" belief.
arXiv Detail & Related papers (2025-03-15T13:40:51Z) - Counterfactual Realizability [52.85109506684737]
We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable.<n>We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
arXiv Detail & Related papers (2025-03-14T20:54:27Z) - Uncommon Belief in Rationality [23.98373492872004]
This paper proposes a graph-based language for capturing higher-order beliefs that agents might have about the rationality of the other agents.<n>The two main contributions are a solution concept that captures the reasoning process based on a given belief structure and an efficient algorithm for compressing any belief structure into a unique minimal form.
arXiv Detail & Related papers (2024-12-12T16:12:40Z) - Grounding Language about Belief in a Bayesian Theory-of-Mind [5.058204320571824]
We take a step towards an answer by grounding the semantics of belief statements in a Bayesian theory-of-mind.
By modeling how humans jointly infer coherent sets of goals, beliefs, and plans, our framework provides a conceptual role semantics for belief.
We evaluate this framework by studying how humans attribute goals and beliefs while watching an agent solve a doors-and-keys gridworld puzzle.
arXiv Detail & Related papers (2024-02-16T02:47:09Z) - A Semantic Approach to Decidability in Epistemic Planning (Extended
Version) [72.77805489645604]
We use a novel semantic approach to achieve decidability.
Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity.
We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
arXiv Detail & Related papers (2023-07-28T11:26:26Z) - Language Models with Rationality [57.37201135072838]
Large language models (LLMs) are proficient at question-answering (QA)
It is not always clear how (or even if) an answer follows from their latent "beliefs"
arXiv Detail & Related papers (2023-05-23T17:04:25Z) - Logical Satisfiability of Counterfactuals for Faithful Explanations in
NLI [60.142926537264714]
We introduce the methodology of Faithfulness-through-Counterfactuals.
It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation.
It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
arXiv Detail & Related papers (2022-05-25T03:40:59Z) - A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
We propose a weaker assumption that we call $2$-adjacency faithfulness.
We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
arXiv Detail & Related papers (2020-10-27T13:04:08Z) - Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic.
Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z)
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.