{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:08:53Z","timestamp":1758121733936,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319733043"},{"type":"electronic","value":"9783319733050"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73305-0_9","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:05:50Z","timestamp":1513872350000},"page":"135-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing Answer Set Computation via Heuristic-Based Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0834","authenticated-orcid":false,"given":"Francesco","family":"Calimeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6944-6869","authenticated-orcid":false,"given":"Davide","family":"Fusc\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-5709","authenticated-orcid":false,"given":"Simona","family":"Perri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6418-7711","authenticated-orcid":false,"given":"Jessica","family":"Zangari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-59776-8_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Abseher","year":"2017","unstructured":"Abseher, M., Musliu, N., Woltran, S.: htd \u2013 a free, open-source framework for\u00a0(customized) tree decompositions and\u00a0beyond. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 376\u2013386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_30"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-61660-5_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2017","unstructured":"Alviano, M., et al.: The ASP system DLV2. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 215\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_19"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_5"},{"key":"9_CR4","doi-asserted-by":"crossref","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."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bichler, M., Morak, M., Woltran, S.: lpopt: a rule optimization tool for answer set programming. In: LOPSTR, pp. 114\u2013130 (2016)","DOI":"10.1007\/978-3-319-63139-4_7"},{"key":"9_CR6","unstructured":"Bliem, B., Moldovan, M., Morak, M., Woltran, S.: The impact of treewidth on ASP grounding and solving. In: Sierra, C. (ed.) IJCAI, pp. 852\u2013858. ijcai.org (2017). http:\/\/www.ijcai.org\/Proceedings\/2017\/"},{"issue":"12","key":"9_CR7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"9_CR8","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 (2012). https:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.03b.pdf"},{"key":"9_CR9","unstructured":"Calimeri, F., Fusc\u00e0, D., Perri, S., Zangari, J.: The ASP instantiator I-DLV. In: PAoASP, Espoo, Finland (2017)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/IA-170104","volume":"11","author":"F Calimeri","year":"2017","unstructured":"Calimeri, F., Fusc\u00e0, D., Perri, S., Zangari, J.: I-DLV: the new intelligent grounder of DLV. Intelligenza Artificiale 11(1), 5\u201320 (2017)","journal-title":"Intelligenza Artificiale"},{"key":"9_CR11","unstructured":"Calimeri, F., Fusc\u00e0, D., Perri, S., Zangari, J.: $$\\cal{I}$$ -DLV $$+\\cal{MS}$$ : preliminary report on an automatic ASP solver selector. In: RCRA (2017, to appear)"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016)","journal-title":"Artif. Intell."},{"issue":"3","key":"9_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","volume":"96","author":"A Pal\u00f9 Dal","year":"2009","unstructured":"Dal Pal\u00f9, A., Dovier, A., Pontelli, E., Rossi, G.: GASP: answer set programming with lazy grounding. Fundamenta Informaticae 96(3), 297\u2013322 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-33353-8_38","volume-title":"Logics in Artificial Intelligence","author":"M Dao-Tran","year":"2012","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Weidinger, G., Weinzierl, A.: OMiGA: an open minded grounding on-the-fly answer set solver. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 480\u2013483. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33353-8_38"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Eiter, T., Kaminski, T., Weinzierl, A.: Lazy-grounding for answer set programs with external source access. In: IJCAI, pp. 1015\u20131022 (2017)","DOI":"10.24963\/ijcai.2017\/141"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-23264-5_31","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp series 3. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 368\u2013383. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_31"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-23264-5_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 531\u2013544. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_44"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Gebser, M., Maratea, M., Ricca, F.: What\u2019s hot in the answer set programming competition. In: AAAI, pp. 4327\u20134329 (2016)","DOI":"10.1609\/aaai.v30i1.9872"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-61660-5_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the seventh answer set programming competition. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 3\u20139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_1"},{"issue":"3\/4","key":"9_CR20","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. New Gener. Comput. 9(3\/4), 365\u2013385 (1991). https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New Gener. Comput."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11604686_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Grohe, M., Musliu, N., Samer, M., Scarcello, F.: Hypertree decompositions: structure, algorithms, and applications. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 1\u201315. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_1"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-44683-4_5","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions: a survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 37\u201357. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_5"},{"issue":"3","key":"9_CR23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25\u201332 (2016)","journal-title":"AI Mag."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-642-04238-6_52","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Lef\u00e8vre","year":"2009","unstructured":"Lef\u00e8vre, C., Nicolas, P.: The first version of a new ASP solver: ASPeRiX. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 522\u2013527. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_52"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45402-0_21","volume-title":"Logic Programming and Nonmotonic Reasoning","author":"N Leone","year":"2001","unstructured":"Leone, N., Perri, S., Scarcello, F.: Improving ASP instantiators by join-ordering methods. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 280\u2013294. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45402-0_21"},{"issue":"3","key":"9_CR26","doi-asserted-by":"crossref","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 Trans. Comput. Log. (TOCL) 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-46767-X_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer set planning. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 373\u2013374. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46767-X_28"},{"key":"9_CR28","unstructured":"Morak, M., Woltran, S.: Preprocessing of complex non-ground rules in answer set programming. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2012)"},{"key":"9_CR29","volume-title":"Principles of Database and Knowledge-Base Systems","author":"JD Ullman","year":"1988","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press, New York (1988)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73305-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:15:05Z","timestamp":1660176905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73305-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319733043","9783319733050"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73305-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}