Advertisement

Ordered Binary Decision Diagrams as Knowledge-Bases

  • Takashi Horiyama
  • Toshihide Ibaraki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S.B. Akers, “Binary Decision Diagrams,” IEEE Trans. Comput., C-27, no.6, pp.509–516, 1978.CrossRefGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Comput., C-35, no.8, pp.677–691, 1986.CrossRefGoogle Scholar
  4. 4.
    O. Coudert, “Doing Two-Level Logic Minimization 100 Times Faster,” Proc. of 6th ACM/SIAM SODA, pp.112–118, 1995.Google Scholar
  5. 5.
    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.CrossRefMathSciNetGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    H.A. Kautz, M.J. Kearns, and B. Selman, “Reasoning with Characteristic Models,” Proc. of AAAI-93, pp.34–39, 1993.Google Scholar
  8. 8.
    H.A. Kautz, M.J. Kearns, and B. Selman, “Horn Approximations of Empirical Data,” Artificial Intelligence, 74, pp.129–245, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    R. Khardon and D. Roth, “Reasoning with Models,” Artificial Intelligence, 87, pp.187–213, 1996.CrossRefMathSciNetGoogle Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    J. McCarthy and P.J. Hayes, “Some Philosophical Problems from the Standpoint of Artificial Intelligence,” Machine Intelligence 4, Edinburgh University Press, 1969.Google Scholar
  13. 13.
    B. Selman and H.J. Levesque, “Abductive and Default Reasoning: A Computational Core,” Proc. of AAAI-90, pp.343–348, 1990.Google Scholar
  14. 14.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Takashi Horiyama
    • 1
  • Toshihide Ibaraki
    • 2
  1. 1.Graduate School of Information ScienceNara Institute of Science and TechnologyNaraJapan
  2. 2.Department of Applied Mathematics and PhysicsKyoto UniversityKyotoJapan

Personalised recommendations