{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:30Z","timestamp":1759063650090,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48318-7_8","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"72-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Evaluation of an Algorithm for the Transversal Hypergraph Problem"],"prefix":"10.1007","author":[{"given":"Dimitris J.","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02136172","volume":"18","author":"R. Ben-Eliyahu","year":"1996","unstructured":"R. Ben-Eliyahu and R. Dechter. On computing minimal models. Annals of Mathematics and Artificial Inteligence, 18:3\u201327, 1996.","journal-title":"Annals of Mathematics and Artificial Inteligence"},{"key":"8_CR2","volume-title":"North Holland Mathematical Library","author":"C. Berge","year":"1989","unstructured":"C. Berge. Hypergraphs, volume 45 of North Holland Mathematical Library. Elsevier Science Publishers B.V., Amsterdam, 1989."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","volume":"42","author":"M. Cadoli","year":"1992","unstructured":"M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 42:113\u2013118, 1992.","journal-title":"Information Processing Letters"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/inco.1995.1087","volume":"119","author":"Z. Chen","year":"1995","unstructured":"Z. Chen and S. Toda. The complexity of selecting maximal solutions. Information and Computation, 119:231\u2013239, 1995.","journal-title":"Information and Computation"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0004-3702(92)90027-U","volume":"56","author":"J. Kleer de","year":"1992","unstructured":"J. de Kleer, A. K. Mackworth, and R. Reiter. Characterising diagnosis and systems. Artificial Intelligence, 56:197\u2013222, 1992.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Computing, 24(6):1278\u20131304, December, 1995.","journal-title":"SIAM J. Computing"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. L. Fredman","year":"1996","unstructured":"M. L. Fredman and L. Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21:618\u2013628, 1996.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of ACM, 32(4):841\u2013860, 1985.","journal-title":"Journal of ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"D. Gunopulos, R. Khardon, H. Mannila, and H. Toinonen. Data mining, hypergraph transversals, and machine learning. In Proc. of Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 209\u2013216, Tucson, Arizona, USA, May 12-14, 1997.","DOI":"10.1145\/263661.263684"},{"key":"8_CR10","unstructured":"V. Gurvich and L. Khachiyan. Generating the irredundent conjunctive and disjunctive normal forms of monotone Boolean functions. Technical Report LCSR-TR-251, Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, 1995."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. S. Johnson","year":"1988","unstructured":"D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119\u2013123, 1988.","journal-title":"Information Processing Letters"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/S0097539795285114","volume":"28","author":"D. Kavvadias","year":"1999","unstructured":"D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM J. Computing, 28(1):152\u2013163, 1999.","journal-title":"SIAM J. Computing"},{"key":"8_CR13","unstructured":"D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos. Generating all maximal models of a Boolean expression. Submitted."},{"key":"8_CR14","series-title":"Technical Report","volume-title":"A new algorithm for the transversal hypergraph problem","author":"D. J. Kavvadias","year":"1999","unstructured":"D. J. Kavvadias and E. C. Stavropoulos. A new algorithm for the transversal hypergraph problem. Technical Report CTI TR 99.03.03, Computer Technology Institute, Patras, Greece, March 1999."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","volume":"32","author":"H. Mannila","year":"1986","unstructured":"H. Mannila and K. J. R\u00e4ih\u00e4. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences, 32(2):126\u2013141,1986.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","volume":"12","author":"H. Mannila","year":"1994","unstructured":"H. Mannila and K. J. R\u00e4ih\u00e4. Algorithms for inferring functional dependencies. Data & Knowledge Engineering, 12(1):83\u201399, February, 1994.","journal-title":"Data & Knowledge Engineering"},{"key":"8_CR17","series-title":"Technical Report","volume-title":"Levelwise search and borders of theories in knowledge discovery","author":"H. Mannila","year":"1997","unstructured":"H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Technical Report C-1997-8, Department of Computer Science, University of Helsinki, Finland, 1997."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"J. McCarthy. Cirmumscription-a form of nonmonotonic reasoning. Artificial Inteligence, 13:27\u201339, 1980.","journal-title":"Artificial Inteligence"},{"key":"8_CR19","unstructured":"C. H. Papadimitriou. NP-completeness: A retrospective. In Proc. of ICALP 98, Bologna, Italy, 1998."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(90)90010-W","volume":"45","author":"B. Selman","year":"1990","unstructured":"B. Selman and H. K. Kautz. Model preference default theories. Artificial Inteligence, 45:287\u2013322, 1990.","journal-title":"Artificial Inteligence"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:05:01Z","timestamp":1587805501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}