Natural revision is contingently-conditionalized revision

• URL: http://arxiv.org/abs/2309.12655v2
• Date: Sat, 24 May 2025 05:24:45 GMT
• Title: Natural revision is contingently-conditionalized revision
• Authors: Paolo Liberatore,
• Abstract summary: Natural revision seems so natural: it changes beliefs as little as possible.<n>Yet, some counterexamples show it wrong.<n>This is right in some cases and wrong in others.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Natural revision seems so natural: it changes beliefs as little as possible to incorporate new information. Yet, some counterexamples show it wrong. It is so conservative that it never fully believes. It only believes in the current conditions. This is right in some cases and wrong in others. Which is which? The answer requires extending natural revision from simple formulae expressing universal truths (something holds) to conditionals expressing conditional truth (something holds in certain conditions). The extension is based on the basic principles natural revision follows, identified as minimal change and naivety: change mind as little as possible; believe what not contradicted. The extension says that natural revision restricts changes to the current conditions. A comparison with an unrestricting revision shows what exactly the current conditions are. It is not what currently considered true if it contradicts the new information. It includes something more and more unlikely until the new information is at least possible.

Related papers

• On Lockean beliefs that are deductively closed and minimal change [1.4624458429745086]
  Lockean belief sets are not generally closed under (classical) logical deduction.<n>We show how we can deductively close a belief set via a minimal revision.
  arXiv  Detail & Related papers  (2025-07-08T14:44:01Z)
• Iterated belief revision: from postulates to abilities [0.0]
  The belief revision field is opulent in new proposals and indigent in analyses of existing approaches.<n>Much work hinge on postulates, employed as syntactic characterizations.
  arXiv  Detail & Related papers  (2025-07-03T05:11:41Z)
• Data Reconstruction: When You See It and When You Don't [75.03157721978279]
  We aim to "sandwich" the concept of reconstruction attacks by addressing two complementing questions. We introduce a new definitional paradigm -- Narcissus Resiliency -- to formulate a security definition for protection against reconstruction attacks.
  arXiv  Detail & Related papers  (2024-05-24T17:49:34Z)
• Some consequences of Sica's approach to Bell's inequalities [55.2480439325792]
  Louis Sica derived Bell's inequalities from the hypothesis that the time series of outcomes observed in one station does not change if the setting in the other station is changed. In this paper, Sica's approach is extended to series with non ideal efficiency and to the actual time structure of experimental data.
  arXiv  Detail & Related papers  (2024-03-05T13:59:52Z)
• Can we forget how we learned? Doxastic redundancy in iterated belief revision [0.0]
  How information was acquired may become irrelevant. Sometimes, a revision becomes redundant even in presence of none equal, or even no else implying it. Shortening sequences of lexicographic revisions is shortening the most compact representations of iterated belief revision states.
  arXiv  Detail & Related papers  (2024-02-23T17:09:04Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• On the Convergence of Bounded Agents [80.67035535522777]
  A bounded agent has converged when the minimal number of states needed to describe the agent's future behavior cannot decrease. The second view says that a bounded agent has converged just when the agent's performance only changes if the agent's internal state changes.
  arXiv  Detail & Related papers  (2023-07-20T17:27:29Z)
• Representing states in iterated belief revision [0.0]
  Iterated belief revision requires information about the current beliefs. Most literature concentrates on how to revise a doxastic state and neglects that it may exponentially grow. This problem is studied for the most common ways of storing a doxastic state.
  arXiv  Detail & Related papers  (2023-05-16T06:16:23Z)
• Minimax Instrumental Variable Regression and $L_2$ Convergence Guarantees without Identification or Closedness [71.42652863687117]
  We study nonparametric estimation of instrumental variable (IV) regressions. We propose a new penalized minimax estimator that can converge to a fixed IV solution. We derive a strong $L$ error rate for our estimator under lax conditions.
  arXiv  Detail & Related papers  (2023-02-10T18:08:49Z)
• Reasoning over Logically Interacted Conditions for Question Answering [113.9231035680578]
  We study a more challenging task where answers are constrained by a list of conditions that logically interact. We propose a new model, TReasoner, for this challenging reasoning task. TReasoner achieves state-of-the-art performance on two benchmark conditional QA datasets.
  arXiv  Detail & Related papers  (2022-05-25T16:41:39Z)
• Situated Conditional Reasoning [10.828616610785524]
  We show that situation-based conditionals can be described in terms of a set of postulates. We then define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure.
  arXiv  Detail & Related papers  (2021-09-03T14:23:18Z)
• 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)
• On Mixed Iterated Revisions [0.2538209532048866]
  A sequence of changes may involve several of them: for example, the first step is a revision, the second a contraction and the third a refinement of the previous beliefs. The ten operators considered in this article are shown to be all reducible to three: lexicographic revision, refinement and severe withdrawal. Most of them require only a number of calls to a satisfiability checker, some are even easier.
  arXiv  Detail & Related papers  (2021-04-08T07:34:56Z)
• Towards Interpretable Natural Language Understanding with Explanations as Latent Variables [146.83882632854485]
  We develop a framework for interpretable natural language understanding that requires only a small set of human annotated explanations for training. Our framework treats natural language explanations as latent variables that model the underlying reasoning process of a neural model.
  arXiv  Detail & Related papers  (2020-10-24T02:05:56Z)
• Revision by Conditionals: From Hook to Arrow [2.9005223064604078]
  We introduce a 'plug and play' method for extending any iterated belief revision operator to the conditional case. The flexibility of our approach is achieved by having the result of a conditional revision determined by that of a plain revision by its corresponding material conditional.
  arXiv  Detail & Related papers  (2020-06-29T05:12:30Z)
• Non-Boolean Hidden Variables model reproduces Quantum Mechanics' predictions for Bell's experiment [91.3755431537592]
  Theory aimed to violate Bell's inequalities must start by giving up Boolean logic. "Hard" problem is to predict the time values when single particles are detected. "Soft" problem is to explain the violation of Bell's inequalities within (non-Boolean) Local Realism.
  arXiv  Detail & Related papers  (2020-05-20T21:46:35Z)

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.