Learning regular sets from queries and counterexamples
Information and Computation
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Inference of finite automata using homing sequences
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
On learning width two branching programs (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Proving circuit correctness using formal comparison between expected and extracted behaviour
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Query learning of bounded-width OBDDs
Theoretical Computer Science - Special issue on algorithmic learning theory
Using computational learning strategies as a tool for combinatorial optimization
Annals of Mathematics and Artificial Intelligence
On Learning Programs and Small Depth Circuits
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Learning Ordered Binary Decision Diagrams
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
A logically complete reasoning maintenance system based on a logical constraint solver
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Comparing learning algorithms in automated assume-guarantee reasoning
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Testing computability by width-two OBDDs
Theoretical Computer Science
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.00 |
In this paper, we propose a new algorithm that exactly learns ordered binary decision diagrams (OBDDs) with a given variable ordering via equivalence and membership queries. Our algorithm uses at most n equivalence queries and at most 2n(@?log"2m@?+3n) membership queries, where n is the number of nodes in the target-reduced OBDD and m is the number of variables. The upper bound on the number of membership queries is smaller by a factor of O(m) compared with that for the previous best known algorithm proposed by [R. Gavalda, D. Guijarro, Learning Ordered Binary Decision Diagrams, Proceedings of the 6th International Workshop on Algorithmic Learning Theory, 1995, pp. 228-238].