{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:33:57Z","timestamp":1760146437656,"version":"3.44.0"},"reference-count":40,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5288,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-92-J-1375","N00014-92-J-4083"],"award-info":[{"award-number":["N00014-92-J-1375","N00014-92-J-4083"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["06044112"],"award-info":[{"award-number":["06044112"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0004-3702(98)00110-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"219-263","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["Logical analysis of binary data with missing bits"],"prefix":"10.1016","volume":"107","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00110-6_bib1","series-title":"Proc. International Conference on Management of Data (SIGMOD-93)","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/S0004-3702(98)00110-6_bib2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","article-title":"The complexity of approximability of finding maximum feasible subsystems of linear relations","volume":"147","author":"Amaldi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(98)00110-6_bib3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(98)00110-6_bib4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Apswall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(98)00110-6_bib5","series-title":"Proc. International Symposium on the Theory of Switching","first-page":"75","article-title":"The decomposition of switching functions","author":"Ashenhurst","year":"1959"},{"key":"10.1016\/S0004-3702(98)00110-6_bib6","series-title":"Proc. 6th Annual Workshop on Computational Learning Theory","first-page":"287","article-title":"Learning with restricted focus of attention","author":"Ben-David","year":"1993"},{"key":"10.1016\/S0004-3702(98)00110-6_bib7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(98)00110-6_bib8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(94)00145-4","article-title":"Decompositions of partially defined Boolean functions","volume":"62","author":"Boros","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0004-3702(98)00110-6_bib9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/S0895480191199385","article-title":"Predicting cause-effect relationships from incomplete discrete observations","volume":"7","author":"Boros","year":"1994","journal-title":"SIAM J. Discrete Math."},{"article-title":"An implementation of logical analysis of data","year":"1996","author":"Boros","key":"10.1016\/S0004-3702(98)00110-6_bib10"},{"key":"10.1016\/S0004-3702(98)00110-6_bib11","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1006\/inco.1997.2687","article-title":"Error-free and best-fit extensions of a partially defined Boolean function","volume":"140","author":"Boros","year":"1998","journal-title":"Inform. and Comput."},{"article-title":"Extensions of partially defined Boolean functions with missing data","year":"1996","author":"Boros","key":"10.1016\/S0004-3702(98)00110-6_bib12"},{"key":"10.1016\/S0004-3702(98)00110-6_bib13","series-title":"Algorithm Theory\u2014SWAT-96","first-page":"440","article-title":"Boolean analysis of incomplete examples","volume":"Vol. 1097","author":"Boros","year":"1996"},{"key":"10.1016\/S0004-3702(98)00110-6_bib14","series-title":"Algorithmic Learning Theory\u2014ALT-97","first-page":"440","article-title":"Monotone extensions of Boolean data sets","volume":"Vol. 1316","author":"Boros","year":"1997"},{"key":"10.1016\/S0004-3702(98)00110-6_bib15","unstructured":"E. Boros, T. Ibaraki, K. Makino, Working paper."},{"key":"10.1016\/S0004-3702(98)00110-6_bib16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02283750","article-title":"Cause-effect relationships and partially defined Boolean functions","volume":"16","author":"Crama","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0004-3702(98)00110-6_bib17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","article-title":"Structure identification in relational data","volume":"58","author":"Dechter","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00110-6_bib18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","article-title":"Logical settings for concept-learning","volume":"95","author":"De Raedt","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00110-6_bib19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/S0004-3702(98)00110-6_bib20"},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0004-3702(98)00110-6_bib21"},{"key":"10.1016\/S0004-3702(98)00110-6_bib22","series-title":"Proc. COLT-97","first-page":"231","article-title":"Learning from examples with unspecified attribute values","author":"Goldman","year":"1997"},{"key":"10.1016\/S0004-3702(98)00110-6_bib23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0004-3702(97)00048-9","article-title":"Exploiting the omission of irrelevant data","volume":"97","author":"Greiner","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00110-6_bib24","series-title":"Algorithms and Computation\u2014ISAAC-93","first-page":"399","article-title":"On Horn envelopes and hypergraph transversals","volume":"Vol. 762","author":"Kavvadias","year":"1993"},{"key":"10.1016\/S0004-3702(98)00110-6_bib25","series-title":"Proc. COLT-95","first-page":"301","article-title":"Learning to reason with a restricted view","author":"Khardon","year":"1995"},{"article-title":"Horn extensions of a partially defined Boolean function","year":"1995","author":"Makino","key":"10.1016\/S0004-3702(98)00110-6_bib26_1"},{"key":"10.1016\/S0004-3702(98)00110-6_bib26_2","unstructured":"also: SIAM J. Comput. (to appear)\""},{"key":"10.1016\/S0004-3702(98)00110-6_bib27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(96)00053-4","article-title":"Positive and Horn decomposability of partially defined Boolean functions","volume":"74","author":"Makino","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0004-3702(98)00110-6_bib28","series-title":"Large-Scale Numerical Optimization","first-page":"22","article-title":"Pattern recognition via linear programming: Theory and applications to medical diagnosis","author":"Mangasarian","year":"1990"},{"key":"10.1016\/S0004-3702(98)00110-6_bib29","series-title":"AAAI Workshop on Knowledge Discovery in Database","first-page":"181","article-title":"Efficient algorithms for discovering association rules","author":"Mannila","year":"1994"},{"year":"1971","series-title":"Threshold Logic and Its Applications","author":"Muroga","key":"10.1016\/S0004-3702(98)00110-6_bib30"},{"year":"1994","series-title":"UCI Repository of machine learning databases [http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html]","author":"Murphy","key":"10.1016\/S0004-3702(98)00110-6_bib31"},{"key":"10.1016\/S0004-3702(98)00110-6_bib32","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00110-6_bib33","series-title":"Applications of Discrete Mathematics","first-page":"122","article-title":"Efficient recognition of matroids and 2-monotonic systems","author":"Provan","year":"1988"},{"key":"10.1016\/S0004-3702(98)00110-6_bib34","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1022643204877","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Machine Learning"},{"year":"1990","series-title":"Coherent Structures and Simple Games","author":"Ramamurthy","key":"10.1016\/S0004-3702(98)00110-6_bib35"},{"key":"10.1016\/S0004-3702(98)00110-6_bib36","series-title":"Proc. IJCAI-95","first-page":"1178","article-title":"Learning to reason: The non-monotonic case","author":"Roth","year":"1995"},{"key":"10.1016\/S0004-3702(98)00110-6_bib37","series-title":"Proc. 20th Canadian Conference on Artificial Intelligence (CSCSI-94)","article-title":"Learning default concepts","author":"Schuurmans","year":"1994"},{"key":"10.1016\/S0004-3702(98)00110-6_bib38","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(98)00110-6_bib39","series-title":"Proc. Workshop on Computational Learning Theory (COLT-95)","first-page":"3","article-title":"Rationality","author":"Valiant","year":"1995"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298001106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298001106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T07:27:19Z","timestamp":1757748439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298001106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0004370298001106"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00110-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1999,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Logical analysis of binary data with missing bits","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0004-3702(98)00110-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}