Heuristics and Experiments on BDD Representation of Boolean Functions for Expert Systems in Software Verification Domains

  • Masahito Kurihara
  • Hisashi Kondo
Conference paper

DOI: 10.1007/3-540-46695-9_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1747)
Cite this paper as:
Kurihara M., Kondo H. (1999) Heuristics and Experiments on BDD Representation of Boolean Functions for Expert Systems in Software Verification Domains. In: Foo N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science, vol 1747. Springer, Berlin, Heidelberg

Abstract

Binary decision diagrams (BDDs) are graph-theoretical, compact representation of Boolean functions, successfully applied in the domain of expert systems for practical VLSI design. The authors have been developing the methods of using BDDs for expert systems that mechanically try to prove the termination of rule-based computer programs. To make BDD representation really practical, however, we need good heuristics for ordering Boolean variables and operations. In this paper, we will present some heuristic methods that could affect the performance and evaluate them through the comprehensive experiments on sample rule-based programs taken from practical domains such as hardware diagnosis, software specification, and mathematics. The results show the big difference among the heuristics and provide us useful information for optimizing the overall systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Masahito Kurihara
    • 1
  • Hisashi Kondo
    • 2
  1. 1.Hokkaido Institute of TechnologySapporoJapan
  2. 2.Ibaraki UniversityHitachiJapan

Personalised recommendations