{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:11:24Z","timestamp":1758190284717,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Z29-INF"],"award-info":[{"award-number":["Z29-INF"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00301-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"283-291","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recognition and dualization of disguised bidual Horn functions"],"prefix":"10.1016","volume":"82","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\/S0020-0190(01)00301-5_BIB001","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","article-title":"Recognizing disguised NR(1) instances of the satisfiability problem","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00301-5_BIB002","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":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB003","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. and Comput."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB004","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":"Optimization Methods Software"},{"issue":"3\u20134","key":"10.1016\/S0020-0190(01)00301-5_BIB005","first-page":"137","article-title":"A survey on knowledge compilation","volume":"10","author":"Cadoli","year":"1997","journal-title":"AI Commun."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB006","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."},{"issue":"6","key":"10.1016\/S0020-0190(01)00301-5_BIB007","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\/S0020-0190(01)00301-5_BIB008","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. and Comput."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB009","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0166-218X(99)00033-5","article-title":"Bidual Horn functions and extensions","volume":"96\u201397","author":"Eiter","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB010","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\/S0020-0190(01)00301-5_BIB011","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB012","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\/S0020-0190(01)00301-5_BIB013","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","article-title":"Removing redundancy from a clause","volume":"61","author":"Gottlob","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0190(01)00301-5_BIB014","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\/S0020-0190(01)00301-5_BIB015","first-page":"1","article-title":"On the geometric separability of Boolean functions","volume":"61","author":"Hegedűs","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB016","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\/S0020-0190(01)00301-5_BIB017","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. Artificial Intelligence Res."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB018","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/322047.322059","article-title":"Renaming a set of clauses as a Horn set","volume":"25","author":"Lewis","year":"1978","journal-title":"J. ACM"},{"year":"2000","series-title":"Efficient dualization of O(logn)-term monotone disjunctive normal forms, Technical Report 00-07, Discrete Mathematics and Systems Science","author":"Makino","key":"10.1016\/S0020-0190(01)00301-5_BIB019"},{"key":"10.1016\/S0020-0190(01)00301-5_BIB020","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\/S0020-0190(01)00301-5_BIB021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","article-title":"LTUR: A simplified linear time unit resolution for Horn formulae and computer implementation","volume":"29","author":"Minoux","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB022","first-page":"79","article-title":"An O(nm) time algorithm for computing the dual of a regular function","volume":"16","author":"Peled","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00301-5_BIB023","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"year":"1987","series-title":"The Complexity of Boolean Functions","author":"Wegener","key":"10.1016\/S0020-0190(01)00301-5_BIB024"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:29:27Z","timestamp":1758083367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001003015"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00301-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Recognition and dualization of disguised bidual Horn functions","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(01)00301-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}