Studia Logica

, Volume 70, Issue 1, pp 131–156

Implementation of Belief Change Operators Using BDDs

  • Nikos Gorogiannis
  • Mark D. Ryan

DOI: 10.1023/A:1014610426691

Cite this article as:
Gorogiannis, N. & Ryan, M.D. Studia Logica (2002) 70: 131. doi:10.1023/A:1014610426691


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.

belief revisionbinary decision diagramsfault diagnosis

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Nikos Gorogiannis
    • 1
  • Mark D. Ryan
    • 1
  1. 1.School of Computer ScienceUniversity of BirminghamBirminghamUK