{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:14:32Z","timestamp":1778548472288,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0020-0190(00)00023-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:34:39Z","timestamp":1027636479000},"page":"157-162","source":"Crossref","is-referenced-by-count":29,"title":["Generating all maximal models of a Boolean expression"],"prefix":"10.1016","volume":"74","author":[{"given":"Dimitris J.","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martha","family":"Sideri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00023-5_ID007","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02136172","article-title":"On computing minimal models","volume":"Vol. 18","author":"Ben-Eliyahu","year":"1996","journal-title":"Ann. of Math. Artificial Intelligence"},{"key":"10.1016\/S0020-0190(00)00023-5_ID008","series-title":"Hypergraphs","volume":"Vol. 45","author":"Berge","year":"1989"},{"key":"10.1016\/S0020-0190(00)00023-5_ID009","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","article-title":"The complexity of model checking for circumscriptive formulae","volume":"Vol. 42","author":"Cadoli","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00023-5_ID010","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/inco.1995.1087","article-title":"The complexity of selecting maximal solutions","volume":"Vol. 119","author":"Chen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(00)00023-5_ID011","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(92)90027-U","article-title":"Characterising diagnosis and systems","volume":"Vol. 56","author":"de Kleer","year":"1992","journal-title":"Artificial Intelligence"},{"issue":"6","key":"10.1016\/S0020-0190(00)00023-5_ID012","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","article-title":"Identifying the minimal transversals of a hypergraph and related problems","volume":"Vol. 24","author":"Eiter","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(00)00023-5_ID013","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0304-3975(96)00202-2","article-title":"Horn functions and submodular Boolean functions","volume":"Vol. 175","author":"Ekin","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00023-5_ID014","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":"Vol. 21","author":"Freidman","year":"1996","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0020-0190(00)00023-5_ID015","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","article-title":"How to assign votes in a distributed system","volume":"Vol. 32","author":"Garcia-Molina","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00023-5_ID016","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(00)00023-5_ID017","series-title":"Proc. of 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning","author":"Gunopulos","year":"12141997"},{"key":"10.1016\/S0020-0190(00)00023-5_ID018","series-title":"Generating the irredundent conjunctive and disjunctive normal forms of monotone Boolean functions","author":"Gurvich","year":"1995"},{"key":"10.1016\/S0020-0190(00)00023-5_ID019","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"Vol. 27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00023-5_ID020","series-title":"Proc. 4th Annual International Symposium on Algorithms and Computation (ISAAC'93), Hong Kong","first-page":"399","article-title":"On Horn envelopes and hypergraph transversals","author":"Kavvadias","year":"1993"},{"issue":"1","key":"10.1016\/S0020-0190(00)00023-5_ID021","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/S0097539795285114","article-title":"The inverse satisfiability problem","volume":"Vol. 28","author":"Kavvadias","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00023-5_ID022","series-title":"Proc. 3rd Workshop on Algorithm Engineering (WAE'99)","first-page":"72","article-title":"Evaluation of an algorithm for the transversal hypergraph problem","author":"Kavvadias","year":"1999"},{"key":"10.1016\/S0020-0190(00)00023-5_ID023","series-title":"Proc. of ICALP 98, Bologna, Italy","article-title":"NP-completeness: A retrospective","author":"Papadimitriou","year":"1998"},{"key":"10.1016\/S0020-0190(00)00023-5_ID024","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"Vol. 38","author":"Przymusinski","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0190(00)00023-5_ID025","series-title":"Proc. 10th Annual ACM Symposium on Theory of Computing, San Diego, CA","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0020-0190(00)00023-5_ID026","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(90)90010-W","article-title":"Model preference default theories","volume":"Vol. 45","author":"Selman","year":"1990","journal-title":"Artificial Intelligence"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000235?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000235?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T08:50:45Z","timestamp":1555231845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0020019000000235"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00023-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}