Implementation of Belief Change Operators Using BDDs

Authors: Gorogiannis N.¹; Ryan M.D.²

Source: Studia Logica, Volume 70, Number 1, February 2002 , pp. 131-156(26)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain a better understanding of the empirical efficiency of the algorithms involved, a fault diagnosis problem on combinational circuits is presented, implemented and evaluated.

Keywords: belief revision; binary decision diagrams; fault diagnosis

Language: English

Document Type: Regular paper

Affiliations: 1: School of Computer Science University of Birmingham Birmingham B15 2TT, UK nkg@cs.bham.ac.uk 2: School of Computer Science University of Birmingham Birmingham B15 2TT, UK mdr@cs.bham.ac.uk

Publication date: 2002-02-01