Updating knowledge bases with disjunctive information

Authors:
Yan Zhang;Norman Y. Foo
Affiliations:
Department of Computing, University of Western Sydney, Nepean, Kingswood, NSW, Australia;Department of Computer Science, University of Sydney, NSW, Australia
Venue:
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Year:
1996

Citing 2
Cited 2

Propositional knowledge base revision and minimal change

Artificial Intelligence
Rule based updates on simple knowledge bases

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)

Reasoning under minimal upper bounds in propositional logic

Theoretical Computer Science
The complexity of belief update

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that the minimal change principle was widely used in knowledge base updates. However, recent research has shown that conventional minimal change methods, eg. the PMA (Winslett 1988), are generally problematic for updating knowledge bases with disjunctive information. In this paper, we propose two different approaches to deal with this problem - one is called the minimal change with exceptions (MCE), the other is called the minimal change with maximal disjunctive inclusions (MCD). The first method is syntax-based, while the second is model-theoretic. We show that these two approaches are equivalent for propositional knowledge base updates, and the second method is also appropriate for first order knowledge base updates. We then prove that our new update approaches still satisfy the standard Katsuno and Mendelzon's update postulates.