{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:02:36Z","timestamp":1743008556108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_36","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"439-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-level Algorithm Selection for ASP"],"prefix":"10.1007","author":[{"given":"Marco","family":"Maratea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Pulina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40564-8_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: a native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 54\u201366. Springer, Heidelberg (2013)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.artint.2012.04.008","volume":"187","author":"M Alviano","year":"2012","unstructured":"Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Artif. Intell. 187, 156\u2013192 (2012)","journal-title":"Artif. Intell."},{"issue":"2","key":"36_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3233\/AIC-2011-0493","volume":"24","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Learning and using domain-specific heuristics in ASP solvers. AI Commun. 24(2), 147\u2013164 (2011)","journal-title":"AI Commun."},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-40564-8_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Bomanson","year":"2013","unstructured":"Bomanson, J., Janhunen, T.: Normalizing cardinality rules using merging and sorting constructions. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 187\u2013199. Springer, Heidelberg (2013)"},{"key":"36_CR5","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: Asp-core-2 input language format (since 2013). https:\/\/www.mat.unical.it\/aspcomp2013\/ASPStandardization"},{"key":"36_CR6","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition. ICLP 2014 TC abs\/1405.3710 (2014). http:\/\/arxiv.org\/abs\/1405.3710"},{"key":"36_CR7","unstructured":"Drescher, C., Gebser, M., Grote, T., Kaufmann, B., K\u00f6nig, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: Proceedings of KR 2008, pp. 422\u2013432. AAAI Press (2008)"},{"issue":"3","key":"36_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM TODS 22(3), 364\u2013418 (1997)","journal-title":"ACM TODS"},{"key":"36_CR9","unstructured":"Frank, E., Witten, I.H.: Generating accurate rule sets without global optimization. In: ICML 1998, p. 144. Morgan Kaufmann Publisher (1998)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as sat modulo acyclicity. In: Proceedings of ECAI 2014, FAIA, vol. 263, pp. 351\u2013356. IOS Press (2014)","DOI":"10.1007\/978-3-319-11558-0_10"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-20895-9_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 352\u2013357. Springer, Heidelberg (2011)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-72200-7_24","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T., Thiele, S.: GrinGo: a new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266\u2013271. Springer, Heidelberg (2007)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. NGC 9, 365\u2013385 (1991)","journal-title":"NGC"},{"issue":"1","key":"36_CR14","first-page":"117","volume":"15","author":"H Hoos","year":"2015","unstructured":"Hoos, H., Kaminski, R., Lindauer, M.T., Schaub, T.: ASPeed: solver scheduling via answer set programming. TPLP 15(1), 117\u2013142 (2015)","journal-title":"TPLP"},{"issue":"4\u20135","key":"36_CR15","first-page":"569","volume":"14","author":"H Hoos","year":"2014","unstructured":"Hoos, H., Lindauer, M.T., Schaub, T.: claspfolio 2: Advances in algorithm selection for answer set programming. TPLP 14(4\u20135), 569\u2013585 (2014)","journal-title":"TPLP"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. J. Appl. Non Class. Logics 16, 35\u201386 (2006)","journal-title":"J. Appl. Non Class. Logics"},{"issue":"3","key":"36_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM TOCL 7(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-03524-6_7","volume-title":"AI*IA 2013: Advances in Artificial Intelligence","author":"M Maratea","year":"2013","unstructured":"Maratea, M., Pulina, L., Ricca, F.: Automated selection of grounding algorithm in answer set programming. In: Baldoni, M., Baroglio, C., Boella, G., Micalizio, R. (eds.) AI*IA 2013. LNCS, vol. 8249, pp. 73\u201384. Springer, Heidelberg (2013)"},{"issue":"6","key":"36_CR19","first-page":"841","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841\u2013868 (2014)","journal-title":"TPLP"},{"key":"36_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-41524-1_6","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"M Nguyen","year":"2013","unstructured":"Nguyen, M., Janhunen, T., Niemel\u00e4, I.: Translating answer-set programs into bit-vector logic. In: Tompits, H., Abreu, S., Oetsch, J., P\u00fchrer, J., Seipel, D., Umeda, M., Wolf, A. (eds.) INAP\/WLP 2011. LNCS, vol. 7773, pp. 91\u2013109. Springer, Heidelberg (2013)"},{"key":"36_CR21","unstructured":"Silverthorn, B., Lierler, Y., Schneider, M.: Surviving solver sensitivity: an ASP practitioner\u2019s guide. In: ICLP 2012, LIPIcs, vol. 17, pp. 164\u2013175 (2012)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:05Z","timestamp":1674259205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}