{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:17:22Z","timestamp":1725585442890},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215803"},{"type":"electronic","value":"9783642215810"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21581-0_10","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:30:19Z","timestamp":1307698219000},"page":"105-119","source":"Crossref","is-referenced-by-count":1,"title":["How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms"],"prefix":"10.1007","author":[{"given":"Martin","family":"Mundhenk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Zeranski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Kavvadias, D.J., Stavropoulos, E.C.: Checking monotone Boolean duality with limited nondeterminism. Technical Report TR2003\/07\/02, Univ. of Patras (2003)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Hagen, M., Horatschek, P., Mundhenk, M.: Experimental comparison of the two Fredman-Khachiyan-algorithms. In: Proc. ALENEX, pp. 154\u2013161 (2009)","DOI":"10.1137\/1.9781611972894.15"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-45138-9_57","volume-title":"Mathematical Foundations of Computer Science 2003","author":"S. Reith","year":"2003","unstructured":"Reith, S.: On the complexity of some equivalence problems for propositional calculi. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 632\u2013641. Springer, Heidelberg (2003)"},{"key":"10_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. on Computing\u00a032(2), 514\u2013537 (2003)","journal-title":"SIAM J. on Computing"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-63165-8_160","volume-title":"Automata, Languages and Programming","author":"C.H. Papadimitriou","year":"1997","unstructured":"Papadimitriou, C.H.: NP-completeness: A retrospective. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 2\u20136. Springer, Heidelberg (1997)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: Proc. of the 3rd IEEE Intl. Conference on Data Mining (ICDM 2003), pp. 485\u2013488 (2003)","DOI":"10.1109\/ICDM.2003.1250958"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G. Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowledge and Information Systems\u00a08(2), 178\u2013202 (2005)","journal-title":"Knowledge and Information Systems"},{"issue":"16","key":"10_CR10","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"L. Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. Discrete Applied Mathematics\u00a0154(16), 2350\u20132372 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7155\/jgaa.00107","volume":"9","author":"D.J. Kavvadias","year":"2005","unstructured":"Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. of Graph Algorithms and Applications\u00a09(2), 239\u2013264 (2005)","journal-title":"J. of Graph Algorithms and Applications"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0020-0190(02)00506-9","volume":"86","author":"L. Lin","year":"2003","unstructured":"Lin, L., Jiang, Y.: The computation of hitting sets: Review and new algorithms. Information Processing Letters\u00a086(4), 177\u2013184 (2003)","journal-title":"Information Processing Letters"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1287\/ijoc.14.2.144.117","volume":"14","author":"V.I. Torvik","year":"2002","unstructured":"Torvik, V.I., Triantaphyllou, E.: Minimizing the average query complexity of learning monotone Boolean functions. INFORMS Journal on Computing\u00a014(2), 144\u2013174 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Uno, T., Satoh, K.: Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization. In: Proc. FIMI (2003)","DOI":"10.1007\/978-3-540-39644-4_22"},{"issue":"7","key":"10_CR15","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"10_CR16","unstructured":"Pretolani, D.: Efficiency and stability of hypergraph sat algorithms. In: Proc. DIMACS Challenge II Workshop (1993)"},{"key":"10_CR17","unstructured":"Buro, M., B\u00fcning, H.K.: Report on a SAT competition (1992)"},{"key":"10_CR18","unstructured":"Kullmann, O.: Investigating the behaviour of a sat solver on random formulas. Technical Report CSR 23-2002, University of Wales (2002)"},{"key":"10_CR19","first-page":"64","volume":"10","author":"W. Quine","year":"1953","unstructured":"Quine, W.: Two theorems about truth functions. Boletin de la Sociedad Matem\u00e1tica Mexicana\u00a010, 64\u201370 (1953)","journal-title":"Boletin de la Sociedad Matem\u00e1tica Mexicana"},{"key":"10_CR20","unstructured":"Tamaki, H.: Space-efficient enumeration of minimal transversals of a hypergraph. In: Proc. SIGAL, pp. 29\u201336 (2000)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A. (ed.) Studies in Constructive Mathematics and Mathematical Logics, Part II, pp. 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11527695_8","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Galesi","year":"2005","unstructured":"Galesi, N., Kullmann, O.: Polynomial time SAT decision, hypergraph transversals and the hermitian rank. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 89\u2013104. Springer, Heidelberg (2005)"},{"key":"10_CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D. Berre Le","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation\u00a07, 59\u201364 (2010)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"10_CR24","unstructured":"Repository, UCI (2010), http:\/\/www.archive.ics.uci.edu\/ml\/"},{"key":"10_CR25","unstructured":"Repository, FIMI (2010), http:\/\/www.fimi.ua.ac.be\/"},{"key":"10_CR26","unstructured":"Murakami, K.: Personal communication (2010)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T21:16:18Z","timestamp":1592601378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}