{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:33Z","timestamp":1759063473814,"version":"3.44.0"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"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","award":["06044112"],"award-info":[{"award-number":["06044112"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00033-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"55-88","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Bidual Horn functions and extensions"],"prefix":"10.1016","volume":"96-97","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00033-5_BIB1","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":"Mach. Learning"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB2","doi-asserted-by":"crossref","unstructured":"D. Angluin, M. Frazier, L. Pitt, Learning conjunctions of Horn clauses, Thirtyfirst Annual Symposium on Foundations of Computer Science, 1990, pp. 186\u2013192.","DOI":"10.1109\/FSCS.1990.89537"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB3","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","article-title":"Minimal representation of directed hypergraphs","volume":"15","author":"Ausiello","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB4","doi-asserted-by":"crossref","first-page":"51","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(99)00033-5_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(94)00145-4","article-title":"Decomposability of partially defined Boolean functions","volume":"62","author":"Boros","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1006\/inco.1997.2687","article-title":"Error-free and best-fit extensions of partially defined Boolean functions","volume":"140","author":"Boros","year":"1998","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB7","doi-asserted-by":"crossref","unstructured":"S. Ceri, G. Gottlob, L. Tanca, Logic Programming and Databases, Springer, Berlin, 1990.","DOI":"10.1007\/978-3-642-83952-8"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB8","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(99)00033-5_BIB9","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":"Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfyability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programm."},{"key":"10.1016\/S0166-218X(99)00033-5_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(99)00033-5_BIB12","unstructured":"T. Eiter, T. Ibaraki, K. Makino, On bidual Horn functions, RUTCOR Research Reports RRR 19-97, September 1997."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1998.2713","article-title":"Double Horn functions","volume":"144","author":"Eiter","year":"1998","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0304-3975(96)00202-2","article-title":"Horn functions and submodular Boolean functions","volume":"175","author":"Ekin","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB15","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(99)00033-5_BIB16","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB17","unstructured":"M. Golumbic, P.L. Hammer, P. Hansen, T. Ibaraki (Eds.), Horn Logic, search and satisfiability, Annals of Mathematics and Artificial Intelligence, vol. 1, 1990."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(92)90250-Y","article-title":"Horn functions and their DNFs","volume":"44","author":"Hammer","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(93)90062-G","article-title":"Optimal compression of propositional Horn knowledge bases","volume":"64","author":"Hammer","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB20","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/69.469822","article-title":"Quasi-acyclic propositional Horn knowledge bases","volume":"7","author":"Hammer","year":"1995","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB21","doi-asserted-by":"crossref","unstructured":"W. Hodges, Logical features of Horn clauses, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming I: Logical Foundations, Clarendon Press, Oxford, UK, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0007"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","article-title":"Unification as a complexity measure for logic programming","volume":"4","author":"Itai","year":"1987","journal-title":"J. Logic Programm."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB23","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(99)00033-5_BIB24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","article-title":"Horn approximations of empirical data","volume":"74","author":"Kautz","year":"1995","journal-title":"Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB25","doi-asserted-by":"crossref","unstructured":"D. Kavvadias, C.H. Papadimitriou, M. Sideri, On Horn envelopes and hypergraph transversals, in: K.W. Ng et al. (Eds.), ISAAC\u201993 Algorithms and Computation, Springer Lecture Notes in Computer Science, vol. 762, 1993, pp. 399\u2013405.","DOI":"10.1007\/3-540-57568-5_271"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB26","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1613\/jair.183","article-title":"Translating between Horn representations and their characteristic models","volume":"3","author":"Khardon","year":"1995","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB27","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322217.322223","article-title":"Minimal covers in the relational database model","volume":"27","author":"Maier","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB28","unstructured":"K. Makino, K. Hatanaka, T. Ibaraki, Horn extensions of a partially defined Boolean function, RUTCOR Research Report RRR 27-95, Rutgers University, 1995."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB29","doi-asserted-by":"crossref","unstructured":"K. Makino, K. Yano, T. Ibaraki, Positive and Horn decomposability of partially defined Boolean functions, Discrete Appl. Math. 74 (1997) 251\u2013274, SIAM J. Comput., to appear.","DOI":"10.1016\/S0166-218X(96)00053-4"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB30","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","article-title":"A way to simplify truth functions","volume":"62","author":"Quine","year":"1955","journal-title":"Am. Math. Mon."},{"key":"10.1016\/S0166-218X(99)00033-5_BIB31","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":"Commun. ACM"},{"key":"10.1016\/S0166-218X(99)00033-5_BIB32","doi-asserted-by":"crossref","unstructured":"I. Wegener, The Complexity of Boolean Functions, Wiley and Teubner, New York, 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000335?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000335?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:39Z","timestamp":1759060599000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":32,"alternative-id":["S0166218X99000335"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00033-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1999,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bidual Horn functions and extensions","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(99)00033-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}