Prioritized and Non-prioritized Multiple Change on Belief Bases

  title={Prioritized and Non-prioritized Multiple Change on Belief Bases},
  author={Marcelo A. Falappa and Gabriele Kern-Isberner and Maur{\'i}cio D. Lu{\'i}s Reis and Guillermo R. Simari},
  journal={Journal of Philosophical Logic},
In this article we explore multiple change operators, i.e., operators in which the epistemic input is a set of sentences instead of a single sentence. We propose two types of change: prioritized change, in which the input set is fully accepted, and symmetric change, where both the epistemic state and the epistemic input are equally treated. In both kinds of operators we propose a set of postulates and we present different constructions: kernel changes and partial meet changes. 
Computing multiple c-revision using OCF knowledge base
This paper focuses on the so-called multiple iterated belief crevision recently proposed by Kern-Isberner, and proposes a computation of c-revision when epistemic states are compactly represented by weighted propositional knowledge bases, called OCF knowledge bases.
A Brief Remark on Non-prioritized Belief Change and the Monotony Postulate
It is shown that it must also discard the monotony postulate for belief expansions if the authors abandon the success postulates, and non-prioritized belief change theories should instead fulfill a weaker postulate, which is called Conditional Monotony.
Choice revision
  • Li Zhang
  • Computer Science
    J. Log. Lang. Inf.
  • 2019
It is proved that each of two variants of choice revision based on a new approach to belief change called descriptor revision is axiomatically characterized with a set of plausible postulates, assuming that the object language is finite.
M ay 2 01 8 Choice revision on belief bases
In this contribution we explore choice revision, a sort of belief change in which the new information is represented by a set of sentences and the agent could accept some of the sentences while
Rational evaluation in belief revision
Rational evaluation is introduced in belief change by axiomatic postulates and two functional constructions are proposed for it, based on the well-known constructions of kernel sets and remainder sets, respectively.
Multiple Revision on Horn Belief Bases
This paper studies the multiple revision of a belief base where the underlying logic is composed by Horn clauses, and defines prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic.
Belief revision in structured probabilistic argumentation
This paper proposes a Probabilistic structured argumentation framework that arises from the extension of Presumptive Defeasible Logic Programming with probabilistic models, and argues that this formalism is capable of addressing basic issues of attribution in cyber security/cyber warfare.
Stratified Belief Bases Revision with Argumentative Inference
A revision operator on a stratified belief base, i.e., a belief base that stores beliefs in different strata corresponding to the value an agent assigns to these beliefs, is proposed to perform the revision in such a way that information is never lost upon revision but stored in a stratum or layer containing information perceived as having a lower value.
A Characterization of Probability-based Dichotomous Belief Revision
This article investigates the properties of multistate top revision , a dichotomous (AGM-style) model of belief revision that is based on an underlying model of probability revision. A proposition is
Multiple Revision in Description Logics
The purpose of this research plan is to define how to operate a multiple revision and, more specifically, how to do this in non-classical logics.


Explanations, belief revision and defeasible reasoning
Credibility limited revision
Five types of constructions are introduced for non-prioritized belief revision, i.e., belief revision in which the input sentence is not always accepted, and close interconnections are shown to hold between the different constructions.
Multiple Kernel Contraction
This paper focuses on the extension of AGM that allows change for a belief base by a set of sentences instead of a single sentence, and proposes for their model another way to construct functions: Multiple Kernel Contraction, that is a modification of kernel Contraction proposed by Hansson.
Selective Revision
A constructive model of selective belief revision is introduced in which it is possible to accept only a part of the input information.
Arbitration: A Commutative Operator for Belief Revision
A different form of revision aiming at capturing the process of “merging” possibly inconsistent pieces of information is introduced, along the lines of Gardenfors’ work, and a set of postulates are proposed and a representation theorem is proved.
Merging Information Under Constraints: A Logical Framework
The paper considers the problem of merging several belief bases in the presence of integrity constraints and proposes a logical characterization of operators having a majority behaviour or a
Revision of Belief Sets and Belief Bases
There are different ways to construct formal models of change, which may be called time-indexed models, which are made indeterministic by allowing for a bundle of functions, typically structured as a branching tree.
A survey of multiple contractions
The AGM theory of belief contraction is extended tomultiple contraction, i.e. to contraction by a set of sentences rather than by a single sentence. There are two major variants: Inpackage
A Syntactical Approach to Revision
Dalal's algorithm is improved by avoiding multiple satisfiability checking, which are NP-complete tasks, and a new distance based on the number of prime implicates in contradiction with the incoming new information is proposed.
Belief Revision: A Vade-Mecum
A set of rationality postulates for revisions are presented and a couple of semi-algorithmic models of revision and updating are introduced that are connected to the postulates via some representation theorems.