Interval Orders, Biorders and Credibility-limited Belief Revision

• URL: http://arxiv.org/abs/2604.27156v1
• Date: Wed, 29 Apr 2026 20:03:14 GMT
• Title: Interval Orders, Biorders and Credibility-limited Belief Revision
• Abstract summary: We show that biorder-based revisions satisfy the Success postulate, but do not always yield consistent outputs.<n>We argue that the biorder-based approach is well-suited for scenarios where an agent might initially reject new information, but may accept it when presented with additional explanation.
• Score: 3.3517146652431378
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rational belief revision is commonly viewed as being based on a preference order between possible worlds, with the resulting new belief set being those sentences true in all the most preferred models of the incoming new information. Usually, such a preference order is taken to be a total preorder. Nevertheless, there are other, more general classes of ordering that can also be employed. In this paper, we explore two such classes that have been studied within the theory of rational choice but have seen limited or no application in belief revision. We begin with interval orders, introduced by Fishburn in the '80s, which associate with each possible world a nonnegative `interval' of plausibility. We then move on to biorders, studied by Aleskerov, Bouyssou, and Monjardet, which generalise interval orders by allowing the intervals to have negative lengths, a feature that can be used to capture a notion of dissonance or instability. We provide axiomatic characterisations of these two resulting families of belief revision operators, as well as of two further families of interest that lie between interval orders and biorders. We show that while biorder-based revisions satisfy the Success postulate, they do not always yield consistent outputs. By modifying their definition to discard inputs that lead to inconsistency as `incredible', we derive new families of so-called non-prioritised revision that satisfy the Consistency postulate, but not the Success one. These families are linked to credibility-limited revision operators of Hansson et al., but for which the set of credible sentences does not satisfy the single-sentence closure condition. We argue that the biorder-based approach is well-suited for scenarios where an agent might initially reject new information, but may accept it when presented with additional explanation.

Related papers

• Belief Memory: Agent Memory Under Partial Observability [56.41506249481312]
  We propose BeliefMem, which shifts the memory paradigm from committing to a single conclusion per observation to retaining multiple candidate conclusions with their probabilities.<n> BeliefMem preserves the uncertainty that the deterministic paradigm discards, enabling the agent to act with high confidence.<n> Empirical evaluations on LoCoMo and ALFWorld benchmarks show that, even with limited data, BeliefMem achieves the best average performance.
  arXiv  Detail & Related papers  (2026-05-07T02:03:13Z)
• Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics (Extended Version) [0.0]
  The paper extends a Hansson-Lewis style preference semantics for dyadic deontic logic.<n>A nonmonotonic reasoning mechanism enables previously derived obligations to be withdrawn when new, potentially conflicting information comes in.
  arXiv  Detail & Related papers  (2026-04-28T11:04:26Z)
• Causal Identification from Counterfactual Data: Completeness and Bounding Results [54.147490305295456]
  We develop an algorithm for identifying counterfactual queries from an arbitrary set of Layer 3 distributions.<n>We establish the theoretical limit of which counterfactuals can be identified from physically realizable distributions.<n>We derive novel analytic bounds for such quantities using realizable counterfactual data.
  arXiv  Detail & Related papers  (2026-02-26T22:48:12Z)
• Operational Noncommutativity in Sequential Metacognitive Judgments [0.0]
  We show that metacognitive evaluations are modeled as state-transforming operations acting on an internal state space with probabilistic readouts.<n>We also outline a behavioral paradigm involving sequential confidence, error-likelihood, and feeling-of-knowing judgments following a perceptual decision.
  arXiv  Detail & Related papers  (2026-02-15T08:15:48Z)
• 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)
• Non-Autoregressive Sentence Ordering [22.45972496989434]
  We propose a novel Non-Autoregressive Ordering Network, dubbed textitNAON, which explores bilateral dependencies between sentences and predicts the sentence for each position in parallel. We conduct extensive experiments on several common-used datasets and the experimental results show that our method outperforms all the autoregressive approaches.
  arXiv  Detail & Related papers  (2023-10-19T10:57:51Z)
• Aggregating Credences into Beliefs: Agenda Conditions for Impossibility Results [0.0]
  We show that path-connectedness and even-negatability constitute the exact agenda condition for the oligarchy result. We compare these novel findings with existing agenda-theoretic characterization theorems in judgment aggregation and belief binarization.
  arXiv  Detail & Related papers  (2023-07-11T07:15:11Z)
• 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)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• 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.