{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:20:13Z","timestamp":1764688813887,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208942"},{"type":"electronic","value":"9783642208959"}],"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-20895-9_35","type":"book-chapter","created":{"date-parts":[[2011,4,25]],"date-time":"2011-04-25T04:40:34Z","timestamp":1303706434000},"page":"304-310","source":"Crossref","is-referenced-by-count":14,"title":["Itemset Mining as a Challenge Application for Answer Set Enumeration"],"prefix":"10.1007","author":[{"given":"Matti","family":"J\u00e4rvisalo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"35_CR2","first-page":"204","volume-title":"Proc.\u00a0KDD","author":"L. Raedt De","year":"2008","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: Proc.\u00a0KDD, pp. 204\u2013212. ACM, New York (2008)"},{"key":"35_CR3","volume-title":"Proc.\u00a0AAAI","author":"L. Raedt De","year":"2010","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for data mining and machine learning. In: Proc.\u00a0AAAI. AAAI Press, Menlo Park (2010)"},{"issue":"11","key":"35_CR4","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D. Burdick","year":"2005","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng.\u00a017(11), 1490\u20131504 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-72200-7_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 136\u2013148. Springer, Heidelberg (2007)"},{"key":"35_CR6","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo (2008), \n                      \n                        http:\/\/potassco.sourceforge.net\/"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20895-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T15:33:35Z","timestamp":1539358415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20895-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208942","9783642208959"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20895-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}