{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:00:59Z","timestamp":1787385659673,"version":"3.56.0"},"reference-count":30,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"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":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00204-4","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"305-312","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient dualization of (n)-term monotone disjunctive normal forms"],"prefix":"10.1016","volume":"126","author":[{"given":"Kazuhisa","family":"Makino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00204-4_BIB1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(87)90131-9","article-title":"An O(mn) time algorithm for regular set-covering problems","volume":"54","author":"Bertolazzi","year":"1987","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1995.1157","article-title":"Complexity of identification and dualization of positive Boolean functions","volume":"123","author":"Bioch","year":"1995","journal-title":"Inform. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB3","doi-asserted-by":"crossref","unstructured":"A. Blum, S. Rudich, Fast learning of k-term DNF formulas with queries, in: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 1992, pp. 382\u2013389.","DOI":"10.1145\/129712.129748"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/10556789808805708","article-title":"Dual subimplicants of positive Boolean functions","volume":"10","author":"Boros","year":"1998","journal-title":"Optim. Methods and Software"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB5","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1137\/S0097539700370072","article-title":"Dual-bounded generating problems","volume":"30","author":"Boros","year":"2001","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/S0097539793269089","article-title":"Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle","volume":"26","author":"Boros","year":"1997","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(87)90056-4","article-title":"Dualization of regular Boolean functions","volume":"16","author":"Crama","year":"1987","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","article-title":"Structure identification in relational data","volume":"5","author":"Dechter","year":"1992","journal-title":"Artif. Intell"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB9","doi-asserted-by":"crossref","unstructured":"C. Domingo, Polynomial time algorithms for some self-duality problems, Proceedings of the Italian Conference of Algorithms, Rome (Italy), Springer Lecture Notes in Computer Science, 1203, (1997) 171\u2013180.","DOI":"10.1007\/3-540-62592-5_70"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1007627028578","article-title":"Efficient read-restricted monotone CNF\/DNF dualization by learning with membership queries","volume":"37","author":"Domingo","year":"1999","journal-title":"Mach. Learning"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB11","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","article-title":"Identifying the minimal transversals of a hypergraph and related problems","volume":"24","author":"Eiter","year":"1995","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB12","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","article-title":"On the complexity of dualization of monotone disjunctive normal forms","volume":"21","author":"Fredman","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB13","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","article-title":"How to assign votes in a distributed system","volume":"32","author":"Garcia-Molina","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","article-title":"On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions","volume":"96\u201397","author":"Gurvich","year":"1999","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB15","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 Distribut. Systems"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB16","unstructured":"T. Ibaraki, A. Kogan, K. Makino, Inferring Functional dependencies in Horn and g-Horn theories, Rutcor Research Report, RRR 35-2000, Rutgers University, 2000, to appear in Annals of Mathematics and Artificial Intelligence."},{"key":"10.1016\/S0166-218X(02)00204-4_BIB17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB18","series-title":"ISAAC\u201993 Algorithms and Computation","first-page":"399","article-title":"On Horn envelopes and hypergraph transversals","volume":"Vol. 762","author":"Kavvadias","year":"1993"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","article-title":"Generating all maximal independent sets","volume":"9","author":"Lawler","year":"1980","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB20","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1137\/S0097539794276324","article-title":"The maximum latency and identification of positive Boolean functions","volume":"26","author":"Makino","year":"1997","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1006\/jagm.1997.0896","article-title":"A fast and simple algorithm for identifying 2-monotonic positive Boolean functions","volume":"26","author":"Makino","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB22","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","article-title":"Design by example","volume":"22","author":"Mannila","year":"1986","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2307\/2268172","article-title":"The decision problem for some classes of sentences without quantifiers","volume":"8","author":"McKinsey","year":"1943","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","article-title":"Polynomial-time algorithm for regular set-covering and threshold synthesis","volume":"12","author":"Peled","year":"1985","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0166-218X(94)90215-1","article-title":"An O(nm)-time algorithm for computing the dual of a regular Boolean function","volume":"49","author":"Peled","year":"1994","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","article-title":"A theory of Diagnosis from first principles","volume":"32","author":"Reiter","year":"1987","journal-title":"Artif. Intell"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB27","first-page":"29","article-title":"Space-efficient enumeration of minimal transversals of a hypergraph","volume":"75","author":"Tamaki","year":"2000","journal-title":"IPSJ-AL"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB28","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB29","doi-asserted-by":"crossref","unstructured":"E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino, On generating all minimal integer solutions for a monotone system of linear inequalities, ICALP2001, edited by F. Orejas et al., Crete, Greece, Springer Lecture Notes in Computer Science 2076 (2001) pp. 92\u2013103.","DOI":"10.1007\/3-540-48224-5_8"},{"key":"10.1016\/S0166-218X(02)00204-4_BIB30","doi-asserted-by":"crossref","unstructured":"D. Gaur and R. Krishnamurti, Self-duality of bounded monotone Boolean functions and related problems, ALT2000, Sydney, Australia, eds. H. Arimura et al., Springer Lecture Notes in Computer Science 1968 (2000) pp. 209\u2013223.","DOI":"10.1007\/3-540-40992-0_16"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002044?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:57:09Z","timestamp":1759060629000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":30,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002044"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00204-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient dualization of -term monotone disjunctive normal forms","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(02)00204-4","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"}]}}