{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:24:25Z","timestamp":1768440265026,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540370338","type":"print"},{"value":"9783540370352","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811220_30","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:40:48Z","timestamp":1153744848000},"page":"354-365","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Minimal Explanations by Minimal Hitting Set Computation"],"prefix":"10.1007","author":[{"given":"Ken","family":"Satoh","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization. In: Proc. of PADL 2005, pp. 174\u2013186 (2005)","DOI":"10.1007\/978-3-540-30557-6_14"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The Complexity of Logic-Based Abduction. Journal of the ACM\u00a042(1), 3\u201342 (1995)","journal-title":"Journal of the ACM"},{"key":"30_CR3","unstructured":"Eiter, T., Makino, K.: On Computing all Abductive Explanations. In: Proc. of AAAI 2002, pp. 62\u201367 (2002)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-45220-1_18","volume-title":"Computer Science Logic","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Makino, K.: Generating All Abductive Explanations for Queries on Propositional Horn Theories. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 197\u2013211. Springer, Heidelberg (2003)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39644-4_1","volume-title":"Discovery Science","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Makino, K.: Abduction and the Dualization Problem. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS, vol.\u00a02843, pp. 1\u201320. Springer, Heidelberg (2003)"},{"issue":"3","key":"30_CR6","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":"30_CR7","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, Hypergraph Transversals, and Machine Learning. In: Proc. of PODS 1997, pp. 209\u2013216 (1997)","DOI":"10.1145\/263661.263684"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharm, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst.\u00a028(2), 140\u2013174 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"30_CR9","first-page":"235","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming 5","author":"A.C. Kakas","year":"1998","unstructured":"Kakas, A.C., Kowalski, R., Toni, F.: The Role of Abduction in Logic Programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming 5, pp. 235\u2013324. Oxford University Press, Oxford (1998)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H. Kautz","year":"1995","unstructured":"Kautz, H., Kearns, M., Selman, B.: Horn Approximations of Empirical Data. Artificial Intelligence\u00a074, 129\u2013245 (1995)","journal-title":"Artificial Intelligence"},{"key":"30_CR11","unstructured":"Mannila, H., Toivonen, T.: On an Algorithm for Finding All Interesting Sentences. In: Cybernetics and Systems, The Thirteen European Meeting on Cybernetics and Systems Research, vol.\u00a0II, pp. 973\u2013978 (1996)"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A Theory of Diagnosis from First Principles. Artificial Intelligence\u00a032, 57\u201395 (1987)","journal-title":"Artificial Intelligence"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-39644-4_22","volume-title":"Discovery Science","author":"K. Satoh","year":"2003","unstructured":"Satoh, K., Uno, T.: Enumerating Maximal Frequent Sets Using Irredundant Dualization. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS, vol.\u00a02843, pp. 256\u2013268. Springer, Heidelberg (2003)"},{"key":"30_CR14","unstructured":"Satoh, K., Uno, T.: Enumerating Minimal Revised Specification using Dualization. In: Proc. of the third workshop on Learning with Logics and Logics for Learning, pp. 19\u201323 (2005)"},{"key":"30_CR15","unstructured":"Uno, T.: A Practical Fast Algorithm for Enumerating Minimal Set Coverings. In: SIGAL 1983, Information Processing Society of Japan (in Japanese), pp. 9\u201316 (2002)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Uno, T., Satoh, K.: Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. In: Online CEUR Workshop Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (FIMI 2003) (2003), http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-90\/satoh.pdf","DOI":"10.1007\/978-3-540-39644-4_22"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811220_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:52Z","timestamp":1605644032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811220_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370338","9783540370352"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11811220_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}