Probabilistically stable revision and comparative probability: a representation theorem and applications

• URL: http://arxiv.org/abs/2509.02495v1
• Date: Tue, 02 Sep 2025 16:42:47 GMT
• Title: Probabilistically stable revision and comparative probability: a representation theorem and applications
• Authors: Krzysztof Mierzewski,
• Abstract summary: We show that a selection function can be representable as a strong-stable-set operator on a finite probability space.<n>The resulting logic of probabilistically stable belief revision exhibits strong monotonicity properties.<n>We point out two applications of our main result to the theory of simple voting games and to revealed preference theory.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The stability rule for belief, advocated by Leitgeb [Annals of Pure and Applied Logic 164, 2013], is a rule for rational acceptance that captures categorical belief in terms of $\textit{probabilistically stable propositions}$: propositions to which the agent assigns resiliently high credence. The stability rule generates a class of $\textit{probabilistically stable belief revision}$ operators, which capture the dynamics of belief that result from an agent updating their credences through Bayesian conditioning while complying with the stability rule for their all-or-nothing beliefs. In this paper, we prove a representation theorem that yields a complete characterisation of such probabilistically stable revision operators and provides a `qualitative' selection function semantics for the (non-monotonic) logic of probabilistically stable belief revision. Drawing on the theory of comparative probability orders, this result gives necessary and sufficient conditions for a selection function to be representable as a strongest-stable-set operator on a finite probability space. The resulting logic of probabilistically stable belief revision exhibits strong monotonicity properties while failing the AGM belief revision postulates and satisfying only very weak forms of case reasoning. In showing the main theorem, we prove two results of independent interest to the theory of comparative probability: the first provides necessary and sufficient conditions for the joint representation of a pair of (respectively, strict and non-strict) comparative probability orders. The second result provides a method for axiomatising the logic of ratio comparisons of the form ``event $A$ is at least $k$ times more likely than event $B$''. In addition to these measurement-theoretic applications, we point out two applications of our main result to the theory of simple voting games and to revealed preference theory.

Related papers

• Reconstruction of finite Quasi-Probability and Probability from Principles: The Role of Syntactic Locality [0.0]
  Quasi-probabilities appear across diverse areas of physics, but their conceptual foundations remain unclear.<n>We develop a principled framework that derives quasi-probabilities and their conditional calculus from structural consistency requirements.
  arXiv  Detail & Related papers  (2026-02-12T19:00:08Z)
• Blind Inverse Game Theory: Jointly Decoding Rewards and Rationality in Entropy-Regularized Competitive Games [0.0]
  We introduce Blind-IGT, the first statistical framework to jointly recover $theta$ and $tau$ from observed behavior.<n>We prove it achieves the optimal $mathcalO(N-1/2)$ convergence rate for joint parameter recovery.<n>We extend our framework to Markov games and demonstrate optimal convergence rates with strong empirical performance.
  arXiv  Detail & Related papers  (2025-11-07T16:27:59Z)
• 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)
• An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (full version) [6.983702226751596]
  The notion of conditional independence is studied in the framework of approximation fixpoint theory.<n>This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics.
  arXiv  Detail & Related papers  (2024-12-18T10:52:57Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• When Does Confidence-Based Cascade Deferral Suffice? [69.28314307469381]
  Cascades are a classical strategy to enable inference cost to vary adaptively across samples. A deferral rule determines whether to invoke the next classifier in the sequence, or to terminate prediction. Despite being oblivious to the structure of the cascade, confidence-based deferral often works remarkably well in practice.
  arXiv  Detail & Related papers  (2023-07-06T04:13:57Z)
• Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism [103.36492220921109]
  We show that although Strong Proportionality is a well-motivated and basic axiom, there is no deterministic strategyproof mechanism satisfying the property. We then identify a randomized mechanism called Random Rank which satisfies Strong Proportionality in expectation. Our main characterizes Random Rank as the unique mechanism that achieves universal truthfulness, universal anonymity, and Strong Proportionality in expectation.
  arXiv  Detail & Related papers  (2022-05-30T00:51:57Z)
• 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)
• The intersection probability: betting with probability intervals [7.655239948659381]
  We propose the use of the intersection probability, a transform derived originally for belief functions in the framework of the geometric approach to uncertainty. We outline a possible decision making framework for probability intervals, analogous to the Transferable Belief Model for belief functions.
  arXiv  Detail & Related papers  (2022-01-05T17:35:06Z)
• 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)
• Preferential Structures for Comparative Probabilistic Reasoning [2.0646127669654826]
  We show that a natural modification of the preferential approach yields exactly the same logical system as a probabilistic approach. The same preferential structures used in the study of non-monotonic logics and belief revision may be used in the study of comparative probabilistic reasoning.
  arXiv  Detail & Related papers  (2021-04-06T05:00:20Z)
• 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)
• On the use of evidence theory in belief base revision [0.0]
  We propose the idea of credible belief base revision yielding to define two new formula-based revision operators. These operators stem from consistent subbases maximal with respect to credibility instead of set inclusion and cardinality.
  arXiv  Detail & Related papers  (2020-09-24T12:45:32Z)

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.