{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T22:05:05Z","timestamp":1778364305375,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614227","type":"print"},{"value":"9783540685296","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_152","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:46Z","timestamp":1330292266000},"page":"440-451","source":"Crossref","is-referenced-by-count":6,"title":["Boolean analysis of incomplete examples"],"prefix":"10.1007","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"38_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning 2 (1988) 319\u2013342","journal-title":"Machine Learning"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Apswall","year":"1979","unstructured":"Apswall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979) 121\u2013123","journal-title":"Information Processing Letters"},{"key":"38_CR3","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/S0895480191199385","volume":"7","author":"E. Boros","year":"1994","unstructured":"Boros, E., Hammer, P. L., Hooker, J. N.: Predicting cause-effect relationships from incomplete discrete observations. SIAM Journal on Discrete Mathematics 7 (1994) 531\u2013543","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"38_CR4","unstructured":"Boros, E., Ibaraki, T., Makino, K.: Error-free and best-fit extensions of a partially defined Boolean function. RUTCOR Research Report RRR 14\u201395, Rutgers University (1995)"},{"key":"38_CR5","unstructured":"Boros, E., Ibaraki, T., Makino, K.: Extensions of partially defined Boolean functions with missing data. RUTCOR Research Report RRR 06\u201396, Rutgers University (1996)"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02283750","volume":"16","author":"Y. Crama","year":"1988","unstructured":"Crama, Y., Hammer, P. L., Ibaraki, T.: Cause-effect relationships and partially defined boolean functions. Annals of Operations Research 16 (1988) 299\u2013326","journal-title":"Annals of Operations Research"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"R. Dechter","year":"1992","unstructured":"Dechter, R., Pearl, J.: Structure identification in relational data. Artificial Intelligence 58 (1992) 237\u2013270","journal-title":"Artificial Intelligence"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Ford, L. R., Fulkerson, D. R.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"38_CR9","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"38_CR10","first-page":"81","volume":"1","author":"J. R. Quinlan","year":"1986","unstructured":"Quinlan, J. R.: Induction of decision trees. Machine Learning 1 (1986) 81\u2013106","journal-title":"Machine Learning"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G.: A theory of the learnable. Communications of the ACM 27 (1984) 1134\u20131142","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:07Z","timestamp":1605647167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_152","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}