Model Transformations for Ranking Functions and Total Preorders

• URL: http://arxiv.org/abs/2203.14018v1
• Date: Sat, 26 Mar 2022 07:58:33 GMT
• Title: Model Transformations for Ranking Functions and Total Preorders
• Authors: Jonas Haldimann, Christoph Beierle
• Abstract summary: We introduce the concept of model transformations to convert an epistemic state from one point of view to another point of view. We show how the well-known advantages of syntax splitting, originally developed for belief sets, can be exploited for belief revision via model transformation.
• Score: 3.42658286826597
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the field of knowledge representation, the considered epistemic states are often based on propositional interpretations, also called worlds. E.g., epistemic states of agents can be modelled by ranking functions or total preorders on worlds. However, there are usually different ways of how to describe a real world situation in a propositional language; this can be seen as different points of view on the same situation. In this paper we introduce the concept of model transformations to convert an epistemic state from one point of view to another point of view, yielding a novel notion of equivalence of epistemic states. We show how the well-known advantages of syntax splitting, originally developed for belief sets and later extended to representation of epistemic states and to nonmonotonic reasoning, can be exploited for belief revision via model transformation by uncovering splittings not being present before. Furthermore, we characterize situations where belief change operators commute with model transformations.

Related papers

• AutoBayes: A Compositional Framework for Generalized Variational Inference [0.0]
  We introduce a new compositional framework for generalized variational inference. We explain that exact Bayesian inference and the loss functions typical of variational inference satisfy chain rules akin to that of reverse-mode automatic differentiation.
  arXiv  Detail & Related papers  (2025-03-24T12:05:45Z)
• A Complexity-Based Theory of Compositionality [53.025566128892066]
  In AI, compositional representations can enable a powerful form of out-of-distribution generalization. Here, we propose a formal definition of compositionality that accounts for and extends our intuitions about compositionality. The definition is conceptually simple, quantitative, grounded in algorithmic information theory, and applicable to any representation.
  arXiv  Detail & Related papers  (2024-10-18T18:37:27Z)
• A hierarchical Bayesian model for syntactic priming [5.765747251519448]
  The effect of syntactic priming exhibits three well-documented empirical properties. We show how these three phenomena can be reconciled in a general learning framework. We also discuss the model's implications for the lexical basis of syntactic priming.
  arXiv  Detail & Related papers  (2024-05-24T22:26:53Z)
• An Axiomatic Approach to Model-Agnostic Concept Explanations [67.84000759813435]
  We propose an approach to concept explanations that satisfy three natural axioms: linearity, recursivity, and similarity. We then establish connections with previous concept explanation methods, offering insight into their varying semantic meanings.
  arXiv  Detail & Related papers  (2024-01-12T20:53:35Z)
• Inverse Decision Modeling: Learning Interpretable Representations of Behavior [72.80902932543474]
  We develop an expressive, unifying perspective on inverse decision modeling. We use this to formalize the inverse problem (as a descriptive model) We illustrate how this structure enables learning (interpretable) representations of (bounded) rationality.
  arXiv  Detail & Related papers  (2023-10-28T05:05:01Z)
• Algebras of actions in an agent's representations of the world [51.06229789727133]
  We use our framework to reproduce the symmetry-based representations from the symmetry-based disentangled representation learning formalism. We then study the algebras of the transformations of worlds with features that occur in simple reinforcement learning scenarios. Using computational methods, that we developed, we extract the algebras of the transformations of these worlds and classify them according to their properties.
  arXiv  Detail & Related papers  (2023-10-02T18:24:51Z)
• 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)
• A calculus for epistemic interactions [0.5156484100374059]
  E-calculus is a concept framework to model agent's interactions with its environment. This paper presents the e-calculus, which provides a concept framework to model agent's interactions with its environment. The behaviour theory of the e-calculus is developed in two different viewpoints.
  arXiv  Detail & Related papers  (2022-06-29T09:54:58Z)
• Latent Topology Induction for Understanding Contextualized Representations [84.7918739062235]
  We study the representation space of contextualized embeddings and gain insight into the hidden topology of large language models. We show there exists a network of latent states that summarize linguistic properties of contextualized representations.
  arXiv  Detail & Related papers  (2022-06-03T11:22:48Z)
• Probabilistic modelling of rational communication with conditionals [0.0]
  We take a probabilistic approach to pragmatic reasoning about conditionals. We show that our model uniformly explains a number of inferences attested in the literature.
  arXiv  Detail & Related papers  (2021-05-12T08:21:25Z)
• Distributional Formal Semantics [0.18352113484137625]
  We propose a Distributional Formal Semantics that integrates distributionality into a formal semantic system on the level of formal models. This approach offers probabilistic, distributed meaning representations that are also inherently compositional. We show how these representations allow for probabilistic inference, and how the information-theoretic notion of "information" naturally follows from it.
  arXiv  Detail & Related papers  (2021-03-02T13:38:00Z)
• Space of Reasons and Mathematical Model [8.475081627511166]
  Inferential relations govern our concept use. In order to understand a concept it has to be located in a space of implications. The crucial questions is: How can the conditionality of language use be represented.
  arXiv  Detail & Related papers  (2020-07-06T01:13:43Z)

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.