First-order Generalization of the MPMA Belief Update Operator

Authors:
Ewa Madalińska-Bugaj;Witold Łukaszewicz
Affiliations:
(Correspd.) Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. ewama@mimuw.edu.pl;Department of Mathematics and Informatics, University of Warmia and Mazury, Żołnierska 14, 10-561 Olsztyn, Poland. witold.lukaszewicz@gmail.com
Venue:
Fundamenta Informaticae
Year:
2009

Citing 6
Cited 1

Updating logical databases

Updating logical databases
Propositional belief base update and minimal change

Artificial Intelligence
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
An Investigation of the Laws of Thought

An Investigation of the Laws of Thought
The PMA and Relativizing Minimal Change for Action Update

Fundamenta Informaticae
Belief update revisited

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Propositional Update Operators Based on Formula/Literal Dependence

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we generalize the MPMA belief update operator by admitting first-order knowledge bases and restricted first-order update formulae. This allows us to consider scenarios which cannot be properly formalized either in the originalMPMA or in other existing approaches to belief update.