Query learning of bounded-width OBDDs

  • Atsuyoshi Nakamura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1160)


In this paper, we study exact learnability of bounded-width ordered binary decision diagrams (OBDDs), when no ordering of the variables is given and learning is conducted by way of equivalence queries and membership queries. We present a learning algorithm for width-2 OBDDs, an algorithm which uses O(n3) equivalence queries alone, where n is the number of variables. We also present a learning algorithm for width-2 OBDDs which uses O(n) proper equivalence queries and O(n2) membership queries. Further, we show a negative result: that there are no polynomial-time algorithms capable of learning width-3 OBDDs from proper equivalence queries alone.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Angluin. “Learning regular sets from queries and counterexamples.” Information and Computation 75, 1987, pp. 87–106.CrossRefGoogle Scholar
  2. 2.
    D. Angluin, L. Hellerstein and M. Karpinski. “Learning Read-Once Formulas with Queries.” Journal of ACM Vol. 40, No. 1, January 1993, pp. 185–210.CrossRefGoogle Scholar
  3. 3.
    F. Bergadano, N. H. Bshouty, C. Tamon and S. Varricchio. “On Learning Branching Programs and Small Circuits.” Unpublished manuscript.Google Scholar
  4. 4.
    R. E. Bryant. “Symbolic boolean manipulation with ordered binary decision diagrams.” ACM Computing Surveys 24, 1992. pp. 293–318.CrossRefGoogle Scholar
  5. 5.
    N. H. Bshouty, C. Tamon and D. K. Wilson. “On Learning Width Two Branching Programs.” To appear in Proc. of COLT'96.Google Scholar
  6. 6.
    F. Ergün, S. Kumar and R. Rubinfeld. “On Learning Bounded-Width Branching Programs.” Proc. of COLT'95, July 1995, pp. 361–368.Google Scholar
  7. 7.
    R. Gavaldá and D. Guijarro. “Learning Ordered Binary Decision Diagrams.” Proc. of ALT'95, October 1995, pp. 228–238.Google Scholar
  8. 8.
    V. Raghavan and D. Wilkins. “Learning μ-Branching Programs with Queries.” Proc. of COLT'93, July 1993, pp. 27–36.Google Scholar
  9. 9.
    H. U. Simon. “Learning Decision Lists and Trees with Equivalence-Queries.” Proc. of EuroCOLT'95, March 1995, pp. 322–336.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Atsuyoshi Nakamura
    • 1
  1. 1.Theory NEC Laboratory RWCP c/o C & C Research LaboratoriesNEC CorporationKawasakiJapan

Personalised recommendations