Merging Rule-based Belief Databases

R. Wehbe (Switzerland)


Logic, Knowledge Representation, Belief Revision.


The problem of revising a belief database is treated in many classical works. We will consider here the problem of merging two belief databases (BDBs for short) Ψ1 and Ψ2, operation that will be denoted by Ψ1⊙Ψ2, and whose result will be a new BDB. Since belief not necessarily reflects the actual state of the world (as opposed to knowledge), both BDBs could be incompatible. The goal is to construct a new BDB trying to retain as much as possible of the origi nal beliefs of Ψ1 and Ψ2.

Important Links:

Go Back