Communications of the ACM
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
Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
An empirical evaluation of knowledge compilation by theory approximation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The complexity of logic-based abduction
Journal of the ACM (JACM)
Horn approximations of empirical data
Artificial Intelligence
Artificial Intelligence
Logic synthesis for large pass transistor circuits
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Fast exact minimization of BDDs
DAC '98 Proceedings of the 35th annual Design Automation Conference
Approximation and decomposition of binary decision diagrams
DAC '98 Proceedings of the 35th annual Design Automation Conference
Doing two-level logic minimization 100 times faster
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
BDS: a BDD-based logic optimization system
Proceedings of the 37th Annual Design Automation Conference
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
OBDD-based function decomposition: algorithms and implementation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Boolean affine approximation with binary decision diagrams
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Knowledge-Based Systems
| Hi-index | 0.00 |
We consider the use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model-based representations. We then present polynomial time algorithms for the two problems of testing whether a given OBDD represents a unate Boolean function, and of testing whether it represents a Horn function.