Dynamic Preference Logic meets Iterated Belief Change: Representation Results and Postulates Characterization

• URL: http://arxiv.org/abs/2101.01676v1
• Date: Tue, 5 Jan 2021 17:47:18 GMT
• Title: Dynamic Preference Logic meets Iterated Belief Change: Representation Results and Postulates Characterization
• Authors: Marlo Souza, \'Alvaro Moreira, Renata Vieira
• Abstract summary: 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.
• Score: 6.329584233209157
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: AGM's belief revision is one of the main paradigms in the study of belief change operations. Recently, several logics for belief and information change have been proposed in the literature and used to encode belief change operations in rich and expressive semantic frameworks. While the connections of AGM-like operations and their encoding in dynamic doxastic logics have been studied before by the work of Segerberg, most works on the area of Dynamic Epistemic Logics (DEL) have not, to our knowledge, attempted to use those logics as tools to investigate mathematical properties of belief change operators. This work investigates how Dynamic Preference Logic, a logic in the DEL family, can be used to study properties of dynamic belief change operators, focusing on well-known postulates of iterated belief change.

Related papers

• MARS: Benchmarking the Metaphysical Reasoning Abilities of Language Models with a Multi-task Evaluation Dataset [50.36095192314595]
  Large Language Models (LLMs) function as conscious agents with generalizable reasoning capabilities. This ability remains underexplored due to the complexity of modeling infinite possible changes in an event. We introduce the first-ever benchmark, MARS, comprising three tasks corresponding to each step.
  arXiv  Detail & Related papers  (2024-06-04T08:35:04Z)
• Logic Agent: Enhancing Validity with Logic Rule Invocation [24.815341366820753]
  Chain-of-Thought prompting has emerged as a pivotal technique for augmenting the inferential capabilities of language models during reasoning tasks. This paper introduces the Logic Agent (LA), an agent-based framework aimed at enhancing the validity of reasoning processes in Large Language Models.
  arXiv  Detail & Related papers  (2024-04-28T10:02:28Z)
• Intuitionistic Quantum Logic Perspective: Static and Dynamic Revision Operators [6.646627444027416]
  We focus on the exploration of a revision theory grounded in quantum mechanics, referred to as the natural revision theory. We combine the advantages of two intuitionistic quantum logic frameworks, as proposed by D"oring and Coecke. We introduce two types of revision operators that correspond to the two reasoning modes in quantum systems: static and dynamic revision.
  arXiv  Detail & Related papers  (2024-04-21T10:35:06Z)
• From Heuristic to Analytic: Cognitively Motivated Strategies for Coherent Physical Commonsense Reasoning [66.98861219674039]
  Heuristic-Analytic Reasoning (HAR) strategies drastically improve the coherence of rationalizations for model decisions. Our findings suggest that human-like reasoning strategies can effectively improve the coherence and reliability of PLM reasoning.
  arXiv  Detail & Related papers  (2023-10-24T19:46:04Z)
• 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)
• The Transformation Logics [58.35574640378678]
  We introduce a new family of temporal logics designed to balance the trade-off between expressivity and complexity. Key feature is the possibility of defining operators of a new kind that we call transformation operators. We show them to yield logics capable of creating hierarchies of increasing expressivity and complexity.
  arXiv  Detail & Related papers  (2023-04-19T13:24:04Z)
• Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
  Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence) We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs) The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
  arXiv  Detail & Related papers  (2022-07-04T14:38:49Z)
• LogiGAN: Learning Logical Reasoning via Adversarial Pre-training [58.11043285534766]
  We present LogiGAN, an unsupervised adversarial pre-training framework for improving logical reasoning abilities of language models. Inspired by the facilitation effect of reflective thinking in human learning, we simulate the learning-thinking process with an adversarial Generator-Verifier architecture. Both base and large size language models pre-trained with LogiGAN demonstrate obvious performance improvement on 12 datasets.
  arXiv  Detail & Related papers  (2022-05-18T08:46:49Z)
• 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)
• De Re Updates [0.0]
  We propose a lightweight yet powerful dynamic logic that captures the distinction between de dicto and de re knowledge. We obtain complete axiomatizations for the counterparts of public announcement logic and event-model-based DEL based on new reduction axioms taking care of the interactions between dynamics and assignments.
  arXiv  Detail & Related papers  (2021-06-22T02:45:25Z)
• A Qualitative Theory of Cognitive Attitudes and their Change [8.417971913040066]
  We show that it allows us to express a variety of relevant concepts for qualitative decision theory. We also present two extensions of the logic, one by the notion of choice and the other by dynamic operators for belief change and desire change.
  arXiv  Detail & Related papers  (2021-02-16T10:28:49Z)

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.