The computer modelling of mathematical reasoning
The computer modelling of mathematical reasoning
A procedure for automatically proving the termination of a set of rewrite rules
Proc. of the first international conference on Rewriting techniques and applications
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Equational reasoning and term rewriting systems
Handbook of logic in artificial intelligence and logic programming (vol. 1)
IEEE Transactions on Computers
A logically complete reasoning maintenance system based on a logical constraint solver
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Binary decision diagrams (BDDs) are graph-theoretical, compact representation of Boolean functions, successfully applied in the domain of expert systems for practiced 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 reeJly practiced, however, we need good heuristics for ordering Booleem 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 hatrdwaxe diagnosis, software specification, and mathematics. The results show the big difference among the heuristics and provide us useful information for optimizing the overall systems.