• Source: Belief revision

Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.
What makes belief revision non-trivial is that several different ways for performing this operation may be possible. For example, if the current knowledge includes the three facts "



A


{\displaystyle A}

is true", "



B


{\displaystyle B}

is true" and "if



A


{\displaystyle A}

and



B


{\displaystyle B}

are true then



C


{\displaystyle C}

is true", the introduction of the new information "



C


{\displaystyle C}

is false" can be done preserving consistency only by removing at least one of the three facts. In this case, there are at least three different ways for performing revision. In general, there may be several different ways for changing knowledge.




Revision and update


Two kinds of changes are usually distinguished:

update
the new information is about the situation at present, while the old beliefs refer to the past; update is the operation of changing the old beliefs to take into account the change;
revision
both the old beliefs and the new information refer to the same situation; an inconsistency between the new and old information is explained by the possibility of old information being less reliable than the new one; revision is the process of inserting the new information into the set of old beliefs without generating an inconsistency.
The main assumption of belief revision is that of minimal change: the knowledge before and after the change should be as similar as possible. In the case of update, this principle formalizes the assumption of inertia. In the case of revision, this principle enforces as much information as possible to be preserved by the change.




= Example

=
The following classical example shows that the operations to perform in the two settings of update and revision are not the same. The example is based on two different interpretations of the set of beliefs



{
a
∨
b
}


{\displaystyle \{a\vee b\}}

and the new piece of information



¬
a


{\displaystyle \neg a}

:

update
in this scenario, two satellites, Unit A and Unit B, orbit around Mars; the satellites are programmed to land while transmitting their status to Earth; and Earth has received a transmission from one of the satellites, communicating that it is still in orbit. However, due to interference, it is not known which satellite sent the signal; subsequently, Earth receives the communication that Unit A has landed. This scenario can be modeled in the following way: two propositional variables



a


{\displaystyle a}

and



b


{\displaystyle b}

indicate that Unit A and Unit B, respectively, are still in orbit; the initial set of beliefs is



{
a
∨
b
}


{\displaystyle \{a\vee b\}}

(either one of the two satellites is still in orbit) and the new piece of information is



¬
a


{\displaystyle \neg a}

(Unit A has landed, and is therefore not in orbit). The only rational result of the update is



¬
a


{\displaystyle \neg a}

; since the initial information that one of the two satellites had not landed yet was possibly coming from the Unit A, the position of the Unit B is not known.
revision
the play "Six Characters in Search of an Author" will be performed in one of the two local theatres. This information can be denoted by



{
a
∨
b
}


{\displaystyle \{a\vee b\}}

, where



a


{\displaystyle a}

and



b


{\displaystyle b}

indicates that the play will be performed at the first or at the second theatre, respectively; a further information that "Jesus Christ Superstar" will be performed at the first theatre indicates that



¬
a


{\displaystyle \neg a}

holds. In this case, the obvious conclusion is that "Six Characters in Search of an Author" will be performed at the second but not the first theatre, which is represented in logic by



¬
a
∧
b


{\displaystyle \neg a\wedge b}

.
This example shows that revising the belief



a
∨
b


{\displaystyle a\vee b}

with the new information



¬
a


{\displaystyle \neg a}

produces two different results



¬
a


{\displaystyle \neg a}

and



¬
a
∧
b


{\displaystyle \neg a\wedge b}

depending on whether the setting is that of update or revision.




Contraction, expansion, revision, consolidation, and merging


In the setting in which all beliefs refer to the same situation, a distinction between various operations that can be performed is made:

contraction
removal of a belief;
expansion
addition of a belief without checking consistency;
revision
addition of a belief while maintaining consistency;
extraction
extracting a consistent set of beliefs and/or epistemic entrenchment ordering;
consolidation
restoring consistency of a set of beliefs;
merging
fusion of two or more sets of beliefs while maintaining consistency.
Revision and merging differ in that the first operation is done when the new belief to incorporate is considered more reliable than the old ones; therefore, consistency is maintained by removing some of the old beliefs. Merging is a more general operation, in that the priority among the belief sets may or may not be the same.
Revision can be performed by first incorporating the new fact and then restoring consistency via consolidation. This is actually a form of merging rather than revision, as the new information is not always treated as more reliable than the old knowledge.




The AGM postulates


The AGM postulates (named after their proponents Alchourrón, Gärdenfors, and Makinson) are properties that an operator that performs revision should satisfy in order for that operator to be considered rational. The considered setting is that of revision, that is, different pieces of information referring to the same situation. Three operations are considered: expansion (addition of a belief without a consistency check), revision (addition of a belief while maintaining consistency), and contraction (removal of a belief).
The first six postulates are called "the basic AGM postulates". In the settings considered by Alchourrón, Gärdenfors, and Makinson, the current set of beliefs is represented by a deductively closed set of logical formulae



K


{\displaystyle K}

called belief set, the new piece of information is a logical formula



P


{\displaystyle P}

, and revision is performed by a binary operator



∗


{\displaystyle *}

that takes as its operands the current beliefs and the new information and produces as a result a belief set representing the result of the revision. The



+


{\displaystyle +}

operator denoted expansion:



K
+
P


{\displaystyle K+P}

is the deductive closure of



K
∪
{
P
}


{\displaystyle K\cup \{P\}}

. The AGM postulates for revision are:

Closure:



K
∗
P


{\displaystyle K*P}

is a belief set (i.e., a deductively closed set of formulae);
Success:



P
∈
K
∗
P


{\displaystyle P\in K*P}


Inclusion:



K
∗
P
⊆
K
+
P


{\displaystyle K*P\subseteq K+P}


Vacuity:




If

(
¬
P
)
∉
K
,

then

K
∗
P
=
K
+
P


{\displaystyle {\text{If }}(\neg P)\not \in K,{\text{ then }}K*P=K+P}


Consistency:



K
∗
P


{\displaystyle K*P}

is inconsistent only if



P


{\displaystyle P}

is inconsistent
Extensionality:




If

P

and

Q

are logically equivalent, then

K
∗
P
=
K
∗
Q


{\displaystyle {\text{If }}P{\text{ and }}Q{\text{ are logically equivalent, then }}K*P=K*Q}

(see logical equivalence)
Superexpansion:



K
∗
(
P
∧
Q
)
⊆
(
K
∗
P
)
+
Q


{\displaystyle K*(P\wedge Q)\subseteq (K*P)+Q}


Subexpansion:




If

(
¬
Q
)
∉
K
∗
P

then

(
K
∗
P
)
+
Q
⊆
K
∗
(
P
∧
Q
)


{\displaystyle {\text{If }}(\neg Q)\not \in K*P{\text{ then }}(K*P)+Q\subseteq K*(P\wedge Q)}


A revision operator that satisfies all eight postulates is the full meet revision, in which



K
∗
P


{\displaystyle K*P}

is equal to



K
+
P


{\displaystyle K+P}

if consistent, and to the deductive closure of



P


{\displaystyle P}

otherwise. While satisfying all AGM postulates, this revision operator has been considered to be too conservative, in that no information from the old knowledge base is maintained if the revising formula is inconsistent with it.




Conditions equivalent to the AGM postulates


The AGM postulates are equivalent to several different conditions on the revision operator; in particular, they are equivalent to the revision operator being definable in terms of structures known as selection functions, epistemic entrenchments, systems of spheres, and preference relations. The latter are reflexive, transitive, and total relations over the set of models.
Each revision operator



∗


{\displaystyle *}

satisfying the AGM postulates is associated to a set of preference relations




≤

K




{\displaystyle \leq _{K}}

, one for each possible belief set



K


{\displaystyle K}

, such that the models of



K


{\displaystyle K}

are exactly the minimal of all models according to




≤

K




{\displaystyle \leq _{K}}

. The revision operator and its associated family of orderings are related by the fact that



K
∗
P


{\displaystyle K*P}

is the set of formulae whose set of models contains all the minimal models of



P


{\displaystyle P}

according to




≤

K




{\displaystyle \leq _{K}}

. This condition is equivalent to the set of models of



K
∗
P


{\displaystyle K*P}

being exactly the set of the minimal models of



P


{\displaystyle P}

according to the ordering




≤

K




{\displaystyle \leq _{K}}

.
A preference ordering




≤

K




{\displaystyle \leq _{K}}

represents an order of implausibility among all situations, including those that are conceivable but yet currently considered false. The minimal models according to such an ordering are exactly the models of the knowledge base, which are the models that are currently considered the most likely. All other models are greater than these ones and are indeed considered less plausible. In general,



I

<

K


J


{\displaystyle I<_{K}J}

indicates that the situation represented by the model



I


{\displaystyle I}

is believed to be more plausible than the situation represented by



J


{\displaystyle J}

. As a result, revising by a formula having



I


{\displaystyle I}

and



J


{\displaystyle J}

as models should select only



I


{\displaystyle I}

to be a model of the revised knowledge base, as this model represent the most likely scenario among those supported by



P


{\displaystyle P}

.




Contraction


Contraction is the operation of removing a belief



P


{\displaystyle P}

from a knowledge base



K


{\displaystyle K}

; the result of this operation is denoted by



K
−
P


{\displaystyle K-P}

. The operators of revision and contractions are related by the Levi and Harper identities:




K
∗
P
=
(
K
−
¬
P
)
+
P


{\displaystyle K*P=(K-\neg P)+P}





K
−
P
=
K
∩
(
K
∗
¬
P
)


{\displaystyle K-P=K\cap (K*\neg P)}


Eight postulates have been defined for contraction. Whenever a revision operator satisfies the eight postulates for revision, its corresponding contraction operator satisfies the eight postulates for contraction and vice versa. If a contraction operator satisfies at least the first six postulates for contraction, translating it into a revision operator and then back into a contraction operator using the two identities above leads to the original contraction operator. The same holds starting from a revision operator.
One of the postulates for contraction has been longly discussed: the recovery postulate:




K
=
(
K
−
P
)
+
P


{\displaystyle K=(K-P)+P}


According to this postulate, the removal of a belief



P


{\displaystyle P}

followed by the reintroduction of the same belief in the belief set should lead to the original belief set. There are some examples showing that such behavior is not always reasonable: in particular, the contraction by a general condition such as



a
∨
b


{\displaystyle a\vee b}

leads to the removal of more specific conditions such as



a


{\displaystyle a}

from the belief set; it is then unclear why the reintroduction of



a
∨
b


{\displaystyle a\vee b}

should also lead to the reintroduction of the more specific condition



a


{\displaystyle a}

. For example, if George was previously believed to have German citizenship, he was also believed to be European. Contracting this latter belief amounts to ceasing to believe that George is European; therefore, that George has German citizenship is also retracted from the belief set. If George is later discovered to have Austrian citizenship, then the fact that he is European is also reintroduced. According to the recovery postulate, however, the belief that he also has German citizenship should also be reintroduced.
The correspondence between revision and contraction induced by the Levi and Harper identities is such that a contraction not satisfying the recovery postulate is translated into a revision satisfying all eight postulates, and that a revision satisfying all eight postulates is translated into a contraction satisfying all eight postulates, including recovery. As a result, if recovery is excluded from consideration, a number of contraction operators are translated into a single revision operator, which can be then translated back into exactly one contraction operator. This operator is the only one of the initial group of contraction operators that satisfies recovery; among this group, it is the operator that preserves as much information as possible.




The Ramsey test


The evaluation of a counterfactual conditional



a
>
b


{\displaystyle a>b}

can be done, according to the Ramsey test (named for Frank P. Ramsey), to the hypothetical addition of



a


{\displaystyle a}

to the set of current beliefs followed by a check for the truth of



b


{\displaystyle b}

. If



K


{\displaystyle K}

is the set of beliefs currently held, the Ramsey test is formalized by the following correspondence:




a
>
b
∈
K


{\displaystyle a>b\in K}

if and only if



b
∈
K
∗
a


{\displaystyle b\in K*a}


If the considered language of the formulae representing beliefs is propositional, the Ramsey test gives a consistent definition for counterfactual conditionals in terms of a belief revision operator. However, if the language of formulae representing beliefs itself includes the counterfactual conditional connective



>


{\displaystyle >}

, the Ramsey test leads to the Gärdenfors triviality result: there is no non-trivial revision operator that satisfies both the AGM postulates for revision and the condition of the Ramsey test. This result holds in the assumption that counterfactual formulae like



a
>
b


{\displaystyle a>b}

can be present in belief sets and revising formulae. Several solutions to this problem have been proposed.




Non-monotonic inference relation


Given a fixed knowledge base



K


{\displaystyle K}

and a revision operator



∗


{\displaystyle *}

, one can define a non-monotonic inference relation using the following definition:



P
⊢
Q


{\displaystyle P\vdash Q}

if and only if



K
∗
P
⊨
Q


{\displaystyle K*P\models Q}

. In other words, a formula



P


{\displaystyle P}

entails another formula



Q


{\displaystyle Q}

if the addition of the first formula to the current knowledge base leads to the derivation of



Q


{\displaystyle Q}

. This inference relation is non-monotonic.
The AGM postulates can be translated into a set of postulates for this inference relation. Each of these postulates is entailed by some previously considered set of postulates for non-monotonic inference relations. Vice versa, conditions that have been considered for non-monotonic inference relations can be translated into postulates for a revision operator. All these postulates are entailed by the AGM postulates.




Foundational revision


In the AGM framework, a belief set is represented by a deductively closed set of propositional formulae. While such sets are infinite, they can always be finitely representable. However, working with deductively closed sets of formulae leads to the implicit assumption that equivalent belief sets should be considered equal when revising. This is called the principle of irrelevance of syntax.
This principle has been and is currently debated: while



{
a
,
b
}


{\displaystyle \{a,b\}}

and



{
a
∧
b
}


{\displaystyle \{a\wedge b\}}

are two equivalent sets, revising by



¬
a


{\displaystyle \neg a}

should produce different results. In the first case,



a


{\displaystyle a}

and



b


{\displaystyle b}

are two separate beliefs; therefore, revising by



¬
a


{\displaystyle \neg a}

should not produce any effect on



b


{\displaystyle b}

, and the result of revision is



{
¬
a
,
b
}


{\displaystyle \{\neg a,b\}}

. In the second case,



a
∧
b


{\displaystyle a\wedge b}

is taken a single belief. The fact that



a


{\displaystyle a}

is false contradicts this belief, which should therefore be removed from the belief set. The result of revision is therefore



{
¬
a
}


{\displaystyle \{\neg a\}}

in this case.
The problem of using deductively closed knowledge bases is that no distinction is made between pieces of knowledge that are known by themselves and pieces of knowledge that are merely consequences of them. This distinction is instead done by the foundational approach to belief revision, which is related to foundationalism in philosophy. According to this approach, retracting a non-derived piece of knowledge should lead to retracting all its consequences that are not otherwise supported (by other non-derived pieces of knowledge). This approach can be realized by using knowledge bases that are not deductively closed and assuming that all formulae in the knowledge base represent self-standing beliefs, that is, they are not derived beliefs. In order to distinguish the foundational approach to belief revision to that based on deductively closed knowledge bases, the latter is called the coherentist approach. This name has been chosen because the coherentist approach aims at restoring the coherence
(consistency) among all beliefs, both self-standing and derived ones. This approach is related to coherentism in philosophy.
Foundationalist revision operators working on non-deductively closed belief sets typically select some subsets of



K


{\displaystyle K}

that are consistent with



P


{\displaystyle P}

, combined them in some way, and then conjoined them with



P


{\displaystyle P}

. The following are two non-deductively closed base revision operators.

WIDTIO
(When in Doubt, Throw it Out) the maximal subsets of



K


{\displaystyle K}

that are consistent with



P


{\displaystyle P}

are intersected, and



P


{\displaystyle P}

is added to the resulting set; in other words, the result of revision is composed by



P


{\displaystyle P}

and of all formulae of



K


{\displaystyle K}

that are in all maximal subsets of



K


{\displaystyle K}

that are consistent with



P


{\displaystyle P}

;
Williams
solved an open problem by developing a new representation for finite bases that allowed for AGM revision and contraction operations to be performed. This representation was translated to a computational model and an anytime algorithm for belief revision was developed.
Ginsberg–Fagin–Ullman–Vardi
the maximal subsets of



K
∪
{
P
}


{\displaystyle K\cup \{P\}}

that are consistent and contain



P


{\displaystyle P}

are combined by disjunction;
Nebel
similar to the above, but a priority among formulae can be given, so that formulae with higher priority are less likely to being retracted than formulae with lower priority.
A different realization of the foundational approach to belief revision is based on explicitly declaring the dependences among beliefs. In the truth maintenance systems, dependence links among beliefs can be specified. In other words, one can explicitly declare that a given fact is believed because of one or more other facts; such a dependency is called a justification. Beliefs not having any justifications play the role of non-derived beliefs in the non-deductively closed knowledge base approach.




Model-based revision and update


A number of proposals for revision and update based on the set of models of the involved formulae were developed independently of the AGM framework. The principle behind this approach is that a knowledge base is equivalent to a set of possible worlds, that is, to a set of scenarios that are considered possible according to that knowledge base. Revision can therefore be performed on the sets of possible worlds rather than on the corresponding knowledge bases.
The revision and update operators based on models are usually identified by the name of their authors: Winslett, Forbus, Satoh, Dalal, Hegner, and Weber. According to the first four of these proposal, the result of revising/updating a formula



K


{\displaystyle K}

by another formula



P


{\displaystyle P}

is characterized by the set of models of



P


{\displaystyle P}

that are the closest to the models of



K


{\displaystyle K}

. Different notions of closeness can be defined, leading to the difference among these proposals.

Peppas and Williams
provided the formal relationship between revision and update. They introduced the Winslett Identity in the Notre Dame Journal of Formal Logic.
Dalal
the models of



P


{\displaystyle P}

having a minimal Hamming distance to models of



K


{\displaystyle K}

are selected to be the models that result from the change;
Satoh
similar to Dalal, but distance between two models is defined as the set of literals that are given different values by them; similarity between models is defined as set containment of these differences;
Winslett
for each model of



K


{\displaystyle K}

, the closest models of



P


{\displaystyle P}

are selected; comparison is done using set containment of the difference;
Borgida
equal to Winslett's if



K


{\displaystyle K}

and



P


{\displaystyle P}

are inconsistent; otherwise, the result of revision is



K
∧
P


{\displaystyle K\wedge P}

;
Forbus
similar to Winslett, but the Hamming distance is used.
The revision operator defined by Hegner makes



K


{\displaystyle K}

not to affect the value of the variables that are mentioned in



P


{\displaystyle P}

. What results from this operation is a formula




K
′



{\displaystyle K'}

that is consistent with



P


{\displaystyle P}

, and can therefore be conjoined with it. The revision operator by Weber is similar, but the literals that are removed from



K


{\displaystyle K}

are not all literals of



P


{\displaystyle P}

, but only the literals that are evaluated differently by a pair of closest models of



K


{\displaystyle K}

and



P


{\displaystyle P}

according to the Satoh measure of closeness.




Iterated revision


The AGM postulates are equivalent to a preference ordering (an ordering over models) to be associated to every knowledge base



K


{\displaystyle K}

. However, they do not relate the orderings corresponding to two non-equivalent knowledge bases. In particular, the orderings associated to a knowledge base



K


{\displaystyle K}

and its revised version



K
∗
P


{\displaystyle K*P}

can be completely different. This is a problem for performing a second revision, as the ordering associated with



K
∗
P


{\displaystyle K*P}

is necessary to calculate



K
∗
P
∗
Q


{\displaystyle K*P*Q}

.
Establishing a relation between the ordering associated with



K


{\displaystyle K}

and



K
∗
P


{\displaystyle K*P}

has been however recognized not to be the right solution to this problem. Indeed, the preference relation should depend on the previous history of revisions, rather than on the resulting knowledge base only. More generally, a preference relation gives more information about the state of mind of an agent than a simple knowledge base. Indeed, two states of mind might represent the same piece of knowledge



K


{\displaystyle K}

while at the same time being different in the way a new piece of knowledge would be incorporated. For example, two people might have the same idea as to where to go on holiday, but they differ on how they would change this idea if they win a million-dollar lottery. Since the basic condition of the preference ordering is that their minimal models are exactly the models of their associated knowledge base, a knowledge base can be considered implicitly represented by a preference ordering (but not vice versa).
Given that a preference ordering allows deriving its associated knowledge base but also allows performing a single step of revision, studies on iterated revision have been concentrated on how a preference ordering should be changed in response of a revision. While single-step revision is about how a knowledge base



K


{\displaystyle K}

has to be changed into a new knowledge base



K
∗
P


{\displaystyle K*P}

, iterated revision is about how a preference ordering (representing both the current knowledge and how much situations believed to be false are considered possible) should be turned into a new preference relation when



P


{\displaystyle P}

is learned. A single step of iterated revision produces a new ordering that allows for further revisions.
Two kinds of preference ordering are usually considered: numerical and non-numerical. In the first case, the level of plausibility of a model is representing by a non-negative integer number; the lower the rank, the more plausible the situation corresponding to the model. Non-numerical preference orderings correspond to the preference relations used in the AGM framework: a possibly total ordering over models. The non-numerical preference relation were initially considered unsuitable for iterated revision because of the impossibility of reverting a revision by a number of other revisions, which is instead possible in the numerical case.
Darwiche and Pearl formulated the following postulates for iterated revision.

if



α
⊨
μ


{\displaystyle \alpha \models \mu }

then



(
ψ
∗
μ
)
∗
α
≡
ψ
∗
α


{\displaystyle (\psi *\mu )*\alpha \equiv \psi *\alpha }

;
if



α
⊨
¬
μ


{\displaystyle \alpha \models \neg \mu }

, then



(
ψ
∗
μ
)
∗
α
≡
ψ
∗
α


{\displaystyle (\psi *\mu )*\alpha \equiv \psi *\alpha }

;
if



ψ
∗
α
⊨
μ


{\displaystyle \psi *\alpha \models \mu }

, then



(
ψ
∗
μ
)
∗
α
⊨
μ


{\displaystyle (\psi *\mu )*\alpha \models \mu }

;
if



ψ
∗
α
⊭
¬
μ


{\displaystyle \psi *\alpha \not \models \neg \mu }

, then



(
ψ
∗
μ
)
∗
α
⊭
¬
μ


{\displaystyle (\psi *\mu )*\alpha \not \models \neg \mu }

.
Specific iterated revision operators have been proposed by Spohn, Boutilier, Williams, Lehmann, and others. Williams also provided a general iterated revision operator.

Spohn rejected revision
this non-numerical proposal has been first considered by Spohn, who rejected it based on the fact that revisions can change some orderings in such a way the original ordering cannot be restored with a sequence of other revisions; this operator change a preference ordering in view of new information



P


{\displaystyle P}

by making all models of



P


{\displaystyle P}

being preferred over all other models; the original preference ordering is maintained when comparing two models that are both models of



P


{\displaystyle P}

or both non-models of



P


{\displaystyle P}

;
Natural revision
while revising a preference ordering by a formula



P


{\displaystyle P}

, all minimal models (according to the preference ordering) of



P


{\displaystyle P}

are made more preferred by all other ones; the original ordering of models is preserved when comparing two models that are not minimal models of



P


{\displaystyle P}

; this operator changes the ordering among models minimally while preserving the property that the models of the knowledge base after revising by



P


{\displaystyle P}

are the minimal models of



P


{\displaystyle P}

according to the preference ordering;
Transmutations
Williams provided the first generalization of belief revision iteration using transmutations. She illustrated transmutations using two forms of revision, conditionalization and adjustment, which work on numerical preference orderings; revision requires not only a formula but also a number or ranking of an existing belief indicating its degree of plausibility; while the preference ordering is still inverted (the lower a model, the most plausible it is) the degree of plausibility of a revising formula is direct (the higher the degree, the most believed the formula is);
Ranked revision
a ranked model, which is an assignment of non-negative integers to models, has to be specified at the beginning; this rank is similar to a preference ordering, but is not changed by revision; what is changed by a sequence of revisions are a current set of models (representing the current knowledge base) and a number called the rank of the sequence; since this number can only monotonically non-decrease, some sequences of revision lead to situations in which every further revision is performed as a full meet revision.




Merging


The assumption implicit in the revision operator is that the new piece of information



P


{\displaystyle P}

is always to be considered more reliable than the old knowledge base



K


{\displaystyle K}

. This is formalized by the second of the AGM postulates:



P


{\displaystyle P}

is always believed after revising



K


{\displaystyle K}

with



P


{\displaystyle P}

. More generally, one can consider the process of merging several pieces of information (rather than just two) that might or might not have the same reliability. Revision becomes the particular instance of this process when a less reliable piece of information



K


{\displaystyle K}

is merged with a more reliable



P


{\displaystyle P}

.
While the input to the revision process is a pair of formulae



K


{\displaystyle K}

and



P


{\displaystyle P}

, the input to merging is a multiset of formulae



K


{\displaystyle K}

,



T


{\displaystyle T}

, etc. The use of multisets is necessary as two sources to the merging process might be identical.
When merging a number of knowledge bases with the same degree of plausibility, a distinction is made between arbitration and majority. This distinction depends on the assumption that is made about the information and how it has to be put together.

Arbitration
the result of arbitrating two knowledge bases



K


{\displaystyle K}

and



T


{\displaystyle T}

entails



K
∨
T


{\displaystyle K\vee T}

; this condition formalizes the assumption of maintaining as much as the old information as possible, as it is equivalent to imposing that every formula entailed by both knowledge bases is also entailed by the result of their arbitration; in a possible world view, the "real" world is assumed one of the worlds considered possible according to at least one of the two knowledge bases;
Majority
the result of merging a knowledge base



K


{\displaystyle K}

with other knowledge bases can be forced to entail



K


{\displaystyle K}

by adding a sufficient number of other knowledge bases equivalent to



K


{\displaystyle K}

; this condition corresponds to a kind of vote-by-majority: a sufficiently large number of knowledge bases can always overcome the "opinion" of any other fixed set of knowledge bases.
The above is the original definition of arbitration. According to a newer definition, an arbitration operator is a merging operator that is insensitive to the number of equivalent knowledge bases to merge. This definition makes arbitration the exact opposite of majority.
Postulates for both arbitration and merging have been proposed. An example of an arbitration operator satisfying all postulates is the classical disjunction. An example of a majority operator satisfying all postulates is that selecting all models that have a minimal total Hamming distance to models of the knowledge bases to merge.
A merging operator can be expressed as a family of orderings over models, one for each possible multiset of knowledge bases to merge: the models of the result of merging a multiset of knowledge bases are the minimal models of the ordering associated to the multiset. A merging operator defined in this way satisfies the postulates for merging if and only if the family of orderings meets a given set of conditions. For the old definition of arbitration, the orderings are not on models but on pairs (or, in general, tuples) of models.




Social choice theory


Many revision proposals involve orderings over models representing the relative plausibility of the possible alternatives. The problem of merging amounts to combine a set of orderings into a single one expressing the combined plausibility of the alternatives. This is similar with what is done in social choice theory, which is the study of how the preferences of a group of agents can be combined in a rational way. Belief revision and social choice theory are similar in that they combine a set of orderings into one. They differ on how these orderings are interpreted: preferences in social choice theory; plausibility in belief revision. Another difference is that the alternatives are explicitly enumerated in social choice theory, while they are the propositional models over a given alphabet in belief revision.




Complexity


From the point of view of computational complexity, the most studied problem about belief revision is that of query answering in the propositional case. This is the problem of establishing whether a formula follows from the result of a revision, that is,



K
∗
P
⊨
Q


{\displaystyle K*P\models Q}

, where



K


{\displaystyle K}

,



P


{\displaystyle P}

, and



Q


{\displaystyle Q}

are propositional formulae. More generally, query answering is the problem of telling whether a formula is entailed by the result of a belief revision, which could be update, merging, revision, iterated revision, etc. Another problem that has received some attention is that of model checking, that is, checking whether a model satisfies the result of a belief revision. A related question is whether such result can be represented in space polynomial in that of its arguments.
Since a deductively closed knowledge base is infinite, complexity studies on belief revision operators working on deductively closed knowledge bases are done in the assumption that such deductively closed knowledge base are given in the form of an equivalent finite knowledge base.
A distinction is made among belief revision operators and belief revision schemes. While the former are simple mathematical operators mapping a pair of formulae into another formula, the latter depend on further information such as a preference relation. For example, the Dalal revision is an operator because, once two formulae



K


{\displaystyle K}

and



P


{\displaystyle P}

are given, no other information is needed to compute



K
∗
P


{\displaystyle K*P}

. On the other hand, revision based on a preference relation is a revision scheme, because



K


{\displaystyle K}

and



P


{\displaystyle P}

do not allow determining the result of revision if the family of preference orderings between models is not given. The complexity for revision schemes is determined in the assumption that the extra information needed to compute revision is given in some compact form. For example, a preference relation can be represented by a sequence of formulae whose models are increasingly preferred. Explicitly storing the relation as a set of pairs of models is instead not a compact representation of preference because the space required is exponential in the number of propositional letters.
The complexity of query answering and model checking in the propositional case is in the second level of the polynomial hierarchy for most belief revision operators and schemas. Most revision operators suffer from the problem of representational blow up: the result of revising two formulae is not necessarily representable in space polynomial in that of the two original formulae. In other words, revision may exponentially increase the size of the knowledge base.




Relevance


New breakthrough results that demonstrate how relevance can be employed in belief revision have been achieved. Williams, Peppas, Foo and Chopra reported the results in the Artificial Intelligence journal.
Belief revision has also been used to demonstrate the acknowledgement of intrinsic social capital in closed networks.




Implementations


Systems specifically implementing belief revision are:

SATEN – an object-oriented web-based revision and extraction engine (Williams, Sims)
ADS – SAT solver–based belief revision (Benferhat, Kaci, Le Berre, Williams)
BReLS
Immortal
Two systems including a belief revision feature are SNePS and Cyc.




See also






Notes






References






External links


Belief revision at PhilPapers
Logic of Belief Revision at the Indiana Philosophy Ontology Project
Zalta, Edward N. (ed.). "Logic of Belief Revision". Stanford Encyclopedia of Philosophy.
Defeasible Reasoning: 4.3 Belief Revision Theory at Stanford Encyclopedia of Philosophy

Kata Kunci Pencarian:

• Orang Samaria
• Bumi
• Kekaisaran Romawi
• Pertumbuhan populasi Kristen
• Feminisme
• Siprus
• Sosialisme
• Mazhab teologi Islam
• Belief revision
• Conservatism (belief revision)
• Belief
• Non-monotonic logic
• Belief–desire–intention software model
• Reason maintenance
• Reinforcement learning
• Counterfactual conditional
• Belief perseverance
• Doxastic logic