Heuristics and Experiments on BDD Representation of Boolean Functions for Expert Systems in Software Verification Domains
- 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
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.
Unable to display preview. Download preview PDF.