Merging rule-based belief databases

Authors:
Ricardo Wehbe
Affiliations:
Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland
Venue:
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Year:
2007

Citing 6
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Reasoning about knowledge

Reasoning about knowledge
Propositional belief base update and minimal change

Artificial Intelligence
Introduction to Default Logic

Introduction to Default Logic
Modal logics for communicating rule-based agents

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Interleaving belief updating and reasoning in abductive logic programming

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 original beliefs of Ψ1 and Ψ2.