AGM Belief Revision, Semantically

• URL: http://arxiv.org/abs/2112.13557v2
• Date: Thu, 6 Jul 2023 05:16:20 GMT
• Title: AGM Belief Revision, Semantically
• Authors: Faiq Miftakhul Falakh, Sebastian Rudolph, Kai Sauerwald
• Abstract summary: 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.
• Score: 1.7403133838762446
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish a generic, model-theoretic characterization of belief revision operators implementing the paradigm of minimal change according to the seminal work by Alchourr\'{o}n, G\"{a}rdenfors, and Makinson (AGM). Our characterization applies to all Tarskian logics, that is, all logics with a classical model-theoretic semantics, and hence a wide variety of formalisms used in knowledge representation and beyond, including many for which a model-theoretic characterization has hitherto been lacking. Our starting point is the approach by Katsuno and Mendelzon (K&M), who provided such a characterization for propositional logic over finite signatures. We generalize K&M's approach to the setting of AGM-style revision over bases in arbitrary Tarskian logics, where base may refer to one of the various ways of representing an agent's beliefs (such as belief sets, arbitrary or finite sets of sentences, or single sentences). Our first core result is a representation theorem providing a two-way correspondence between AGM-style revision operators and specific assignments: functions associating every base to a "preference" relation over interpretations, which must be total but is - in contrast to prior approaches - not always transitive. As our second core contribution, we provide a characterization of all logics for which our result can be strengthened to assignments producing transitive preference relations (as in K&M's original work). Alongside these main contributions, we discuss diverse variants of our findings as well as ramifications for other areas of belief revision theory.

Related papers

• Nondeterministic Causal Models [7.550566004119157]
  We generalize acyclic deterministic structural equation models to the nondeterministic case. We provide a sound and complete axiomatization of the resulting logic.
  arXiv  Detail & Related papers  (2024-05-22T21:17:52Z)
• A Primer for Preferential Non-Monotonic Propositional Team Logics [0.0]
  We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated by the non-classical interpretation of disjunction in team semantics, we give a precise characterization for preferential models for propositional dependence logic.
  arXiv  Detail & Related papers  (2024-05-11T09:53:15Z)
• Position Paper: Generalized grammar rules and structure-based generalization beyond classical equivariance for lexical tasks and transduction [7.523978255716284]
  We propose a general framework for building models that can generalize compositionally using the concept of Generalized Grammar Rules (GGRs) Our framework is general enough to contain many existing works as special cases. We present ideas on how GGRs might be implemented, and in the process draw connections to reinforcement learning and other areas of research.
  arXiv  Detail & Related papers  (2024-02-02T18:44:37Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• 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)
• Mix and Reason: Reasoning over Semantic Topology with Data Mixing for Domain Generalization [48.90173060487124]
  Domain generalization (DG) enables a learning machine from multiple seen source domains to an unseen target one. mire consists of two key components, namely, Category-aware Data Mixing (CDM) and Adaptive Semantic Topology Refinement (ASTR) experiments on multiple DG benchmarks validate the effectiveness and robustness of the proposed mire.
  arXiv  Detail & Related papers  (2022-10-14T06:52:34Z)
• Compositional Generalization Requires Compositional Parsers [69.77216620997305]
  We compare sequence-to-sequence models and models guided by compositional principles on the recent COGS corpus. We show structural generalization is a key measure of compositional generalization and requires models that are aware of complex structure.
  arXiv  Detail & Related papers  (2022-02-24T07:36:35Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• A General Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics [3.2872586139884623]
  We generalize the approach of Katsuno and Mendelzon for characterizing AGM base revision. Our core result is a representation theorem using the assignment of total. We provide a characterization of all logics for which our result can be strengthened to preorder assignments.
  arXiv  Detail & Related papers  (2021-04-29T17:24:21Z)
• On a plausible concept-wise multipreference semantics and its relations with self-organising maps [0.0]
  We argue that this proposal satisfies some desired properties, such as KLM, and avoids the drowning problem. We motivate the plausibility of the concept-wise multi-preference semantics by developing a logical semantics of self-organising maps.
  arXiv  Detail & Related papers  (2020-08-30T21:06:06Z)
• Invariant Rationalization [84.1861516092232]
  A typical rationalization criterion, i.e. maximum mutual information (MMI), finds the rationale that maximizes the prediction performance based only on the rationale. We introduce a game-theoretic invariant rationalization criterion where the rationales are constrained to enable the same predictor to be optimal across different environments. We show both theoretically and empirically that the proposed rationales can rule out spurious correlations, generalize better to different test scenarios, and align better with human judgments.
  arXiv  Detail & Related papers  (2020-03-22T00:50:27Z)

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.