{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:45Z","timestamp":1759638585364,"version":"3.44.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","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","075506"],"award-info":[{"award-number":["06044112","075506"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00053-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"251-274","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Positive and Horn decomposability of partially defined Boolean functions"],"prefix":"10.1016","volume":"74","author":[{"given":"Kazuhisa","family":"Makino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kojin","family":"Yano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00053-4_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A liner-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Apswall","year":"1979","journal-title":"Inform. Process. Lett."},{"article-title":"Decompositions of partially defined Boolean functions","year":"1994","author":"Boros","key":"10.1016\/S0166-218X(96)00053-4_BIB2"},{"article-title":"Error-free and best-fit extensions of partially defined Boolean functions","year":"1995","author":"Boros","key":"10.1016\/S0166-218X(96)00053-4_BIB3"},{"key":"10.1016\/S0166-218X(96)00053-4_BIB4","first-page":"264","article-title":"Multilevel logic synthesis","volume":"78","author":"Brayton","year":"1990"},{"key":"10.1016\/S0166-218X(96)00053-4_BIB5","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\/S0166-218X(96)00053-4_BIB6","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TC.1980.1675497","article-title":"Synthesis of combinational logic using decomposition and probability","volume":"29","author":"Crist","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(96)00053-4_BIB7","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\/S0166-218X(96)00053-4_BIB8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfying of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programm."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0166-218X(96)00053-4_BIB9"},{"key":"10.1016\/S0166-218X(96)00053-4_BIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/T-C.1973.223604","article-title":"Complex disjunctive decomposition of incompletely specified Boolean functions","volume":"22","author":"Hight","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(96)00053-4_BIB11","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1109\/71.238300","article-title":"A theory of coteries: Mutual exclusion in distributed systems","volume":"4","author":"Ibaraki","year":"1993","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"year":"1970","series-title":"Optimization Theory for Large Systems","author":"Lasdon","key":"10.1016\/S0166-218X(96)00053-4_BIB12"},{"year":"1983","series-title":"The Theory of Relational Databases","author":"Maier","key":"10.1016\/S0166-218X(96)00053-4_BIB13"},{"article-title":"Horn extensions of a partially defined Boolean function","year":"1995","author":"Makino","key":"10.1016\/S0166-218X(96)00053-4_BIB14"},{"key":"10.1016\/S0166-218X(96)00053-4_BIB15","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\/S0166-218X(96)00053-4_BIB16"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000534?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000534?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:30Z","timestamp":1759060590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000534"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00053-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1997,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Positive and Horn decomposability of partially defined Boolean functions","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(96)00053-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}