Abstract
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 represen- tations 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S.B. Akers, “Binary Decision Diagrams,” IEEE Trans. Comput., C-27, no.6, pp.509–516, 1978.
K.S. Brace, R.L. Rundell, and R.E. Bryant, “Efficient Implementation of a BDD Package,” Proc. of 27th ACM/IEEE DAC, pp.40–45, 1990.
R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Comput., C-35, no.8, pp.677–691, 1986.
O. Coudert, “Doing Two-Level Logic Minimization 100 Times Faster,” Proc. of 6th ACM/SIAM SODA, pp.112–118, 1995.
W.F. Dowling and J.H. Gallier, “Linear Time Algorithms for Testing the Satisfiability of Horn Formula,” J. Logic Programm., 3, pp.267–284, 1984.
K. Hayase and H. Imai, “OBDDs of a Monotone Function and of Its Implicants,” Proc. of ISAAC-96, LNCS 1178, Springer, pp. 136–145, 1996.
H.A. Kautz, M.J. Kearns, and B. Selman, “Reasoning with Characteristic Models,” Proc. of AAAI-93, pp.34–39, 1993.
H.A. Kautz, M.J. Kearns, and B. Selman, “Horn Approximations of Empirical Data,” Artificial Intelligence, 74, pp.129–245, 1995.
D. Kavvadias, C. Papadimitriou, and M. Sideri, “On Horn Envelopes and Hyper-graph Transversals,” Proc. of ISAAC-93, LNCS 762, Springer, pp. 399–405, 1993.
R. Khardon and D. Roth, “Reasoning with Models,” Artificial Intelligence, 87, pp.187–213, 1996.
J.C. Madre and O. Coudert, “A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver,” Proc. of IJCAI-91, pp.294–299, 1991.
J. McCarthy and P.J. Hayes, “Some Philosophical Problems from the Standpoint of Artificial Intelligence,” Machine Intelligence 4, Edinburgh University Press, 1969.
B. Selman and H.J. Levesque, “Abductive and Default Reasoning: A Computational Core,” Proc. of AAAI-90, pp.343–348, 1990.
N. Takahashi, N. Ishiura, and S. Yajima, “Fault Simulation for Multiple Faults Using BDD Representation of Fault Sets,” Proc. of ICCAD-91, pp.550–553, 1991.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horiyama, T., Ibaraki, T. (1999). Ordered Binary Decision Diagrams as Knowledge-Bases. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive