On Definite Iterated Belief Revision with Belief Algebras

2025-05-10

AI Summary

Traditional belief revision frameworks suffer from weak axiomatic constraints, yielding multiple admissible revision outcomes for the same belief state and new evidence—undermining determinism required in safety-critical applications. This paper introduces a preference-based algebraic semantics for belief revision, pioneering the integration of belief algebras into iterative revision modeling. We propose the Upper-Bound Axiom, a novel constraint ensuring strict uniqueness of revision results. Theoretically, we prove existence, uniqueness, and decidability of the revision operator under this axiomatized system. Algorithmically, we devise a deterministic revision algorithm computable in polynomial time. Our work achieves a paradigm shift from non-deterministic, multi-solution revision to deterministic, single-solution revision—substantially enhancing predictability and engineering applicability of belief revision in real-world systems.

Technology Category

• Knowledge Representation and Reasoning: Reasoning with Beliefs
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Traditional logic-based belief revision research focuses on designing rules to constrain the behavior of revision operators. Frameworks have been proposed to characterize iterated revision rules, but they are often too loose, leading to multiple revision operators that all satisfy the rules under the same belief condition. In many practical applications, such as safety critical ones, it is important to specify a definite revision operator to enable agents to iteratively revise their beliefs in a deterministic way. In this paper, we propose a novel framework for iterated belief revision by characterizing belief information through preference relations. Semantically, both beliefs and new evidence are represented as belief algebras, which provide a rich and expressive foundation for belief revision. Building on traditional revision rules, we introduce additional postulates for revision with belief algebra, including an upper-bound constraint on the outcomes of revision. We prove that the revision result is uniquely determined given the current belief state and new evidence. Furthermore, to make the framework more useful in practice, we develop a particular algorithm for performing the proposed revision process. We argue that this approach may offer a more predictable and principled method for belief revision, making it suitable for real-world applications.

Problem

• Determining unique iterated belief revision operators
• Representing beliefs and evidence as algebras
• Ensuring deterministic belief updates for safety

Innovation

• Represent beliefs and evidence as belief algebras
• Introduce postulates with upper-bound constraint
• Develop algorithm for deterministic belief revision