{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T13:54:49Z","timestamp":1723557289893},"reference-count":11,"publisher":"Elsevier BV","issue":"16","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1811,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1016\/j.disc.2007.07.024","type":"journal-article","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T11:16:34Z","timestamp":1187435794000},"page":"3668-3687","source":"Crossref","is-referenced-by-count":3,"title":["On the number of minimal transversals in 3-uniform hypergraphs"],"prefix":"10.1016","volume":"308","author":[{"given":"Zbigniew","family":"Lonc","sequence":"first","affiliation":[]},{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.disc.2007.07.024_bib1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190110403","article-title":"The number of maximal independent sets in connected graphs","volume":"11","author":"F\u00fcredi","year":"1987","journal-title":"J. Graph Theory"},{"issue":"2\u20133","key":"10.1016\/j.disc.2007.07.024_bib2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(88)90114-8","article-title":"The number of maximal independent sets in a connected graph","volume":"68","author":"Griggs","year":"1988","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.disc.2007.07.024_bib3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0406022","article-title":"The number of maximal independent sets in triangle-free graphs","volume":"6","author":"Hujter","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2007.07.024_bib4","doi-asserted-by":"crossref","unstructured":"O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theoretical Computer Science, 1999, pp. 1\u201372.","DOI":"10.1016\/S0304-3975(98)00017-6"},{"issue":"4","key":"10.1016\/j.disc.2007.07.024_bib5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00297512","article-title":"Circumscriptive theories: a logic-based framework for knowledge representation","volume":"17","author":"Lifschitz","year":"1988","journal-title":"J. Philos. Logic"},{"key":"10.1016\/j.disc.2007.07.024_bib6","unstructured":"Z. Lonc, M. Truszczy\u0144ski, Computing minimal models, stable models, and answer sets, Lecture Notes in Computer Science, vol. 2916, Springer, Berlin, 2003, pp. 209\u2013223."},{"issue":"1\u20132","key":"10.1016\/j.disc.2007.07.024_bib7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.disc.2007.07.024_bib8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."},{"issue":"1","key":"10.1016\/j.disc.2007.07.024_bib9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/0401012","article-title":"A note on independent sets in trees","volume":"1","author":"Sagan","year":"1988","journal-title":"SIAM J. Discrete Math."},{"issue":"2\u20133","key":"10.1016\/j.disc.2007.07.024_bib10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(81)90225-9","article-title":"Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets","volume":"37","author":"Tomescu","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2007.07.024_bib11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1137\/0607015","article-title":"The number of maximal independent sets in a tree","volume":"7","author":"Wilf","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0700550X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0700550X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,5]],"date-time":"2019-01-05T03:26:15Z","timestamp":1546658775000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0700550X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":11,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["S0012365X0700550X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2007.07.024","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}