{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:07:35Z","timestamp":1760706455304,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00413-3","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T15:19:50Z","timestamp":1034954390000},"page":"977-995","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Logical analysis of data with decomposable structures"],"prefix":"10.1016","volume":"289","author":[{"given":"Hirotaka","family":"Ono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1992","series-title":"Computational Learning Theory","author":"Anthony","key":"10.1016\/S0304-3975(01)00413-3_BIB1"},{"year":"1999","series-title":"Complexity and Approximation","author":"Ausiello","key":"10.1016\/S0304-3975(01)00413-3_BIB2"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1022655006810","article-title":"Monotonicity maintenance in information-theoretic machine learning algorithms","volume":"19","author":"Ben-David","year":"1995","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB4","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\/S0304-3975(01)00413-3_BIB5","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. Comput."},{"key":"10.1016\/S0304-3975(01)00413-3_BIB6","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/69.842268","article-title":"An implementation of logical analysis of data","volume":"12","author":"Boros","year":"2000","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0304-3975(01)00413-3_BIB7","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\/S0304-3975(01)00413-3_BIB8","unstructured":"U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy, (Eds.), Advances in Knowledge Discovery and Data Mining, AAAI Press, California, 1996."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0304-3975(01)00413-3_BIB9"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB10","doi-asserted-by":"crossref","unstructured":"N. Garg, V.V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs, ICALP\u201994, Lecture Notes in Computer Science, Vol. 820, Springer, Berlin, 1994, pp. 487\u2013498.","DOI":"10.1007\/3-540-58201-0_92"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0097539793243016","article-title":"Approximate max-flow min-(multi)cut theorems and their applications","volume":"25","author":"Garg","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00413-3_BIB12","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."},{"year":"1971","series-title":"Threshold Logic and Its Applications","author":"Muroga","key":"10.1016\/S0304-3975(01)00413-3_BIB13"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB14","first-page":"143","article-title":"Boosting first order learning","volume":"Vol. 1316","author":"Quinlan","year":"1996"},{"key":"10.1016\/S0304-3975(01)00413-3_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","article-title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning tress","volume":"5","author":"Read","year":"1975","journal-title":"Networks"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:26Z","timestamp":1759625546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004133"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00413-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Logical analysis of data with decomposable structures","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00413-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}