Belief Revision

A family of formal logics where conclusions are provisionally held and can be retracted when new, conflicting evidence arrives. This is the foundational logical framework that makes belief revision necessary and possible, as it models the defeasibility of real-world inference.

• Contrast with Classical Logic: In classical monotonic logic, adding premises never invalidates a conclusion. Non-monotonic systems (like Default Logic and Autoepistemic Logic) explicitly model exceptions.
• Key Mechanism: Uses defeasible rules of the form 'if A, then typically B.' The conclusion B holds unless there is specific evidence to the contrary.
• Application: Essential for commonsense reasoning in AI, where an agent must act on incomplete information and revise its beliefs as its world model improves.

The principle that the optimal revised belief set is the one that achieves the greatest internal consistency and explanatory integration with all available evidence. It's a guiding objective for belief revision algorithms.

• Holistic Evaluation: Unlike simply accepting the logical conjunction of old beliefs and new evidence, coherence maximization seeks a globally optimal configuration where beliefs mutually support each other.
• Measures of Coherence: Can be quantified via constraint satisfaction (minimizing logical contradictions) or probabilistic measures (maximizing the joint probability of the belief network).
• Relation to Belief Revision: Formalized in the AGM postulates (Alchourrón, Gärdenfors, Makinson), which provide axioms for rational revision, such as maintaining consistency and minimizing change.

A computational technique for maintaining a probability distribution over a set of competing belief states (hypotheses) as sequential, noisy evidence is observed. It's a practical implementation of probabilistic belief revision over time.

• Core Algorithm: Often implemented via extensions to the Kalman filter (for continuous states) or multiple hypothesis tracking algorithms that manage a branching tree of possibilities.
• Key Challenge: Combats cognitive commitment by explicitly keeping unlikely explanations alive, preventing premature convergence on a single flawed belief state.
• Use Case: Critical in target tracking (radar/sonar), diagnostic systems where multiple faults are possible, and natural language understanding to maintain multiple interpretations of ambiguous dialogue.

A specific type of non-monotonic inference that applies typical-case assumptions in the absence of specific information to the contrary. It represents a common-sense 'jump to conclusion' that is later subject to belief revision.

• Formal Rule: 'Birds typically fly.' From 'Tweety is a bird,' we defeasibly conclude 'Tweety flies.' Upon learning 'Tweety is a penguin,' this conclusion is retracted.
• Role in Revision: Default conclusions create the provisional beliefs that form the substrate for future revision operations when exceptional evidence is encountered.
• Computational Frameworks: Implemented in Default Logic (Raymond Reiter) and is a core behavior of logic programming languages like Prolog with negation-as-failure.

The normative, probabilistic framework for revising degrees of belief (credences) in light of new evidence, governed by Bayes' theorem. It is the quantitative counterpart to logical belief revision.

• Core Formula: P(H|E) = [P(E|H) * P(H)] / P(E). It precisely calculates the posterior probability of a hypothesis H given evidence E.
• Contrast with Logical Revision: While logical revision deals with binary true/false beliefs, Bayesian updating handles graded beliefs (probabilities). The principle of conservatism is enforced by using the prior P(H).
• Application: The foundation for probabilistic graphical models, Bayesian networks, and optimal sensor fusion, providing a mathematically rigorous method for belief revision under uncertainty.

The process of integrating multiple, potentially conflicting belief sets from different sources (e.g., multiple agents, sensors, or experts) into a single, consistent collective belief set. It generalizes belief revision to multi-source input.

• Key Distinction: Belief revision handles a single agent's beliefs vs. new evidence. Belief merging handles multiple prior belief sets with equal or weighted standing.
• Operators: Uses merging operators (like Δ) that take multiple belief bases (K1, K2,... Kn) and output a merged base Δ(K1,..., Kn), satisfying postulates for fairness, consistency, and majority representation.
• Use Case: Essential for multi-agent system coordination, database integration, and jury-style deliberation in ensemble AI systems.