{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:29:52Z","timestamp":1752985792634},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:30:15Z","timestamp":1330281015000},"page":"228-238","source":"Crossref","is-referenced-by-count":15,"title":["Learning ordered binary decision diagrams"],"prefix":"10.1007","author":[{"given":"Ricard","family":"Gavald\u00e0","sequence":"first","affiliation":[]},{"given":"David","family":"Guijarro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D. Angluin: \u201cLearning regular sets from queries and counterexamples\u201d. Information and Computation\n75 (1987), 87\u2013106.","journal-title":"Information and Computation"},{"key":"17_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin: \u201cQueries and concept learning\u201d. Machine Learning\n2 (1988), 319\u2013342.","journal-title":"Machine Learning"},{"key":"17_CR3","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin: \u201cNegative results for equivalence queries\u201d Machine Learning\n5 (1990), 121\u2013150.","journal-title":"Machine Learning"},{"key":"17_CR4","unstructured":"B. Bollig and I. Wegener: Improving the variable ordering of OBDDs is NP-complete. Technical Report # 542, Universit\u00e4t Dortmund (1994)."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"R.E. Bryant: \u201cSymbolic boolean manipulation with ordered binary decision diagrams\u201d. ACM Computing Surveys\n24 (1992), 293\u2013318.","journal-title":"ACM Computing Surveys"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-08860-1_17","volume":"62","author":"S. Fortune","year":"1978","unstructured":"S. Fortune, J. Hopcroft, and E. Schmidt: \u201cThe complexity of equivalence and containment for free single variable program schemes\u201d. Proc. 5th Intl. Colloquium on Automata, Languages, and Programming. Springer-Verlag Lecture Notes in Computer Science 62 (1978), 227\u2013240.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"17_CR7","unstructured":"M. Garey and D. Johnson: Computers and intractability: a guide to the theory of NP-completeness. Freeman 1979."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(94)00048-4","volume":"50","author":"J. Gergov","year":"1994","unstructured":"J. Gergov and C. Meinel: \u201cOn the complexity of analysis and manipulation of Boolean functions in terms of decision graphs\u201d. Information Processing Letters\n50 (1994), 317\u2013322.","journal-title":"Information Processing Letters"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"V. Raghavan and D. Wilkins: \u201cLearning \u03bc-branching programs with queries\u201d. Proc. 6th COLT (1993), 27\u201336.","DOI":"10.1145\/168304.168308"},{"key":"17_CR10","unstructured":"R.E. Schapire: The Design and Analysis of Efficient Learning Algorithms. MIT Press, 1992."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-57568-5_270","volume":"762","author":"S. Tani","year":"1993","unstructured":"S. Tani, K. Hamaguchi, and S. Yajima: \u201cThe complexity of the optimal variable ordering problems for shared binary decision diagrams\u201d, Proc. 4th Intl. Symposium ISAAC'93. Springer Verlag Lecture Notes in Computer Science 762 (1993), 389\u2013398.","journal-title":"Springer Verlag Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:25:26Z","timestamp":1619573126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}