A syntactical approach to belief update

Authors:
Jerusa Marchi;Guilherme Bittencourt;Laurent Perrussel
Affiliations:
,Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, SC, Brazil;Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, SC, Brazil;Manufacture des Tabacs, IRIT – Université Toulouse I, Toulouse, France
Venue:
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Year:
2005

Citing 7
Cited 2

An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Optimizing the clausal normal form transformation

Journal of Automated Reasoning
On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence
Propositional belief base update and minimal change

Artificial Intelligence
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
Introducing actions into qualitative simulation

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A perspective on knowledge compilation

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantum-Based Belief Merging

IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Prime forms and minimal change in propositional belief bases

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Belief Change domain, Katsuno and Mendelzon have proposed a set of postulates that should be satisfied by update operators. In 1989, Forbus semantically defined an update operator that satisfies these postulates. In order to calculate the resulting belief base all models of the relevant belief bases must be known. This paper proposes to use the prime implicants and prime implicates normal forms to represent these bases. Using this representation, a syntactical and computationally cheaper version of Forbus belief update operator is defined and a new minimal distance is proposed. We claim that this minimal distance ensures a better commitment between the minimal change criterion and the belief update definition.