We consider translation among conjunctive normal forms (CNFs), characteristic models, and ordered binary decision diagrams (OBDDs) of Boolean functions. It is shown in this paper that Horn OBDDs can be translated into their Horn CNFs in polynomial time. As for the opposite direction, the problem can
Ordered binary decision diagrams as knowledge-bases
β Scribed by Takashi Horiyama; Toshihide Ibaraki
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 258 KB
- Volume
- 136
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
β¦ Synopsis
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 CNFbased 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. ο 2002 Published by Elsevier Science B.V.
π SIMILAR VOLUMES
## Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on the chosen ordering of the variables. It is known that there are
In decision analysis, building a decision model such as an influence diagram is a burdensome problem requiring time and effort, and the resulting model is generally applicable to only one specific problem. In this research, an influence diagram is built using the technology of knowledgebased systems