An Abstract Worlds Semantic Framework for Belief Change Operators

• URL: http://arxiv.org/abs/2606.02163v1
• Date: Mon, 01 Jun 2026 12:24:43 GMT
• Title: An Abstract Worlds Semantic Framework for Belief Change Operators
• Abstract summary: This article proposes a set-theoretic framework for belief change, called Abstract Worlds Semantics.<n>Inspired by Grove's (1988) results, our approach treats worlds as primitive elements, over which world contraction and world revision operators are defined.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This article proposes a set-theoretic framework for belief change, called Abstract Worlds Semantics, in which no logical syntax is assumed. Inspired by Grove's (1988) results, our approach treats worlds as primitive elements, over which world contraction and world revision operators are defined. This semantic framework enables a unified analysis of belief change models. Within this framework, we unify classical and non-prioritized belief change constructions by defining versatile operators. When classical propositional logic is considered, our framework provides a homogeneous account of AGM, KM, and Multiple Change models. In summary, AWS systematizes belief change frameworks and operators, simplifying and generalizing belief change theory over belief sets.

Related papers

• CHAL: Council of Hierarchical Agentic Language [0.5156484100374058]
  We argue that the genuine value of debate, and dialectic systems as a whole, lies in defeasible domains.<n>We present the Council ofHierarchical Agentic Language (CHAL), a multi-agent dialectic framework that treats defeasible argumentation as an engine for belief optimization.
  arXiv  Detail & Related papers  (2026-05-12T20:26:41Z)
• MidSteer: Optimal Affine Framework for Steering Generative Models [53.89402578892719]
  MidSteer is a more general affine framework for concept manipulation that relaxes assumptions and enables directed, minimal-disturbance transformations.<n>We demonstrate that MidSteer performs favorably across a range of tasks, modalities, and architectures.
  arXiv  Detail & Related papers  (2026-04-17T19:23:33Z)
• Towards Domain-Generalized Open-Vocabulary Object Detection: A Progressive Domain-invariant Cross-modal Alignment Method [59.30562121800656]
  Open-Vocabulary Object Detection has achieved remarkable success in generalizing to novel categories.<n>We provide a principled revisit of the OVOD paradigm, uncovering a fundamental vulnerability.<n>We propose Progressive Domain-invariant Cross-modal Alignment (PICA)
  arXiv  Detail & Related papers  (2026-03-29T07:39:31Z)
• OMNIFLOW: A Physics-Grounded Multimodal Agent for Generalized Scientific Reasoning [51.33849811496781]
  Large Language Models (LLMs) have demonstrated exceptional logical reasoning capabilities but frequently struggle with the continuous dynamics by Partial Differential Equations (PDEs)<n>We propose OMNIFLOW, a multimodal-symbolic architecture designed to ground frozen LLMs in fundamental physical laws without requiring domain-specific parameter updates.<n>We evaluate it on a benchmark spanning microscopic turbulence, theoretical Navier-Stokes, and macroscopic global weather forecasting.
  arXiv  Detail & Related papers  (2026-03-16T18:29:01Z)
• Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds [55.2480439325792]
  This article develops a novel framework for modal logic based on the idea of stratified actualization.<n>Traditional Kripke semantics treat modal operators as quantification over fully determinate alternatives.<n>We propose a system Stratified Actualization Logic (SAL) in which modalities are indexed by levels of ontological stability, interpreted as admissibility.
  arXiv  Detail & Related papers  (2025-06-12T18:35:01Z)
• Hierarchical Invariance for Robust and Interpretable Vision Tasks at Larger Scales [54.78115855552886]
  We show how to construct over-complete invariants with a Convolutional Neural Networks (CNN)-like hierarchical architecture. With the over-completeness, discriminative features w.r.t. the task can be adaptively formed in a Neural Architecture Search (NAS)-like manner. For robust and interpretable vision tasks at larger scales, hierarchical invariant representation can be considered as an effective alternative to traditional CNN and invariants.
  arXiv  Detail & Related papers  (2024-02-23T16:50:07Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• AGM Belief Revision, Semantically [1.7403133838762446]
  We establish a generic, model-theoretic characterization of belief revision operators implementing the paradigm of minimal change. Our characterization applies to all Tarskian logics, that is, all logics with a classical model-theoretic semantics.
  arXiv  Detail & Related papers  (2021-12-27T07:53:21Z)
• On Limited Non-Prioritised Belief Revision Operators with Dynamic Scope [2.7071541526963805]
  We introduce the concept of dynamic-limited revision, which are revisions expressible by a total preorder over a limited set of worlds. For a belief change operator, we consider the scope, which consists of those beliefs which yield success of revision. We show that for each set satisfying single sentence closure and disjunction completeness there exists a dynamic-limited revision having the union of this set with the beliefs set as scope.
  arXiv  Detail & Related papers  (2021-08-17T17:22:29Z)
• Dynamic Preference Logic meets Iterated Belief Change: Representation Results and Postulates Characterization [6.329584233209157]
  AGM's belief revision is one of the main paradigms in the study of belief change operations. Several logics for belief and information change have been proposed in the literature. This work investigates how Dynamic Preference Logic can be used to study properties of dynamic belief change operators.
  arXiv  Detail & Related papers  (2021-01-05T17:47:18Z)
• 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.