Abstract
In this paper, we propose a new algorithm which exactly learns ordered binary decision diagrams (OBDDs) with a given variable ordering via equivalence queries and membership queries. Our algorithm uses at most n equivalence queries and at most 2n([log2 m] + 3n) membership queries, where n is the number of nodes in the target reduced OBDD and m is the number of variables. We have reduced the number of membership queries by a factor of m compared with the best known algorithm for this problem due to Gavaldà and Guijarro.
Real World Computing Partnership
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75 (1987) 87–106
Bergadano, F., Bshouty, N., Tamon, C., Varricchio, S.: On Learning Branching Programs and Small Circuits. Unpublished manuscript (http://www.cpsc.ucalgary.ca/bshouty/papers.html)
Birkendorf, A., Simon, H.: Using Computational Learning Strategies as a Tool for Combinatorial Optimization. Proc. of the 4th International Symposium on AI and Math. (1996) 18–22
Bshouty, N., Tamon C., Wilson, D.: On Learning Width Two Branching Programs. Proc. of the 9th Annual Conference on Computational Learning Theory (1996) 224–227
Ergün, F., Kumar, S., Rubinfeld, R.: On Learning Bounded-Width Branching Programs. Proc. of the 9th Annual Conference on Computational Learning Theory (1995) 361–368
Gavaldà , R., Guijarro, D.: Learning Ordered Binary Decision Diagrams. Proc. of the 6th International Workshop on Algorithmic Learning Theory (1995) 228–238
Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. The MIT Press (1994)
Nakamura, A.: Query Learning of Bounded-Width OBDDs. Proc. of the 7th International Workshop on Algorithmic Learning Theory (1996) 37–50
Rivest, R., Schapire, R.: Inference of Finite Automata Using Homing Sequences. Information and Computation 103 (1993) 299–347
Raghavan, V., Wilkins, D.: Learning p-Branching Programs with Queries. Proc. of the 7th Annual Conference on Computational Learning Theory (1993) 27–36 *** DIRECT SUPPORT *** A0008157 00006
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, A. (1997). An efficient exact learning algorithm for ordered binary decision diagrams. In: Li, M., Maruoka, A. (eds) Algorithmic Learning Theory. ALT 1997. Lecture Notes in Computer Science, vol 1316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63577-7_51
Download citation
DOI: https://doi.org/10.1007/3-540-63577-7_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63577-2
Online ISBN: 978-3-540-69602-5
eBook Packages: Springer Book Archive