Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Horn approximations of empirical data
Artificial Intelligence
Artificial Intelligence
Doing two-level logic minimization 100 times faster
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
OBDDs of a Monotone Function and of Its Prime Implicants
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
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
Reasoning with Ordered Binary Decision Diagrams
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations in the sense of space requirement. We then consider two recognition problems of OBDDs, and present polynomial time algorithms for testing whether a given OBDD represents a unate Boolean function, and whether it represents a Horn function.