{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:18Z","timestamp":1742912418750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_31","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T16:27:54Z","timestamp":1557160074000},"page":"479-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm Selection for Paracoherent Answer Set Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-9671","authenticated-orcid":false,"given":"Giovanni","family":"Amendola","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0330-5868","authenticated-orcid":false,"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0258-3222","authenticated-orcid":false,"given":"Luca","family":"Pulina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"issue":"2\u20133","key":"31_CR1","first-page":"177","volume":"32","author":"WT Adrian","year":"2018","unstructured":"Adrian, W.T., et al.: The ASP system DLV: advancements and applications. KI 32(2\u20133), 177\u2013179 (2018)","journal-title":"KI"},{"key":"31_CR2","unstructured":"Adrian, W.T., Manna, M., Leone, N., Amendola, G., Adrian, M.: Entity set expansion from the web via ASP. In: ICLP (Technical Communications). OASICS, vol. 58, pp. 1:1\u20131:5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"31_CR3","first-page":"37","volume":"6","author":"D Aha","year":"1991","unstructured":"Aha, D., Kibler, D., Albert, M.: Instance-based learning algorithms. Mach. Learn. 6(1), 37\u201366 (1991)","journal-title":"Mach. Learn."},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Alviano, M., Amendola, G., Pe\u00f1aloza, R.: Minimal undefinedness for fuzzy answer sets. In: AAAI 2017, pp. 3694\u20133700 (2017)","DOI":"10.1609\/aaai.v31i1.11045"},{"key":"31_CR5","unstructured":"Amendola, G.: Dealing with incoherence in ASP: split semi-equilibrium semantics. In: DWAI@AI*IA. CEUR Workshop Proceedings, vol. 1334, pp. 23\u201332 (2014)"},{"key":"31_CR6","unstructured":"Amendola, G.: Preliminary results on modeling interdependent scheduling games via answer set programming. In: RiCeRcA@AI*IA. CEUR Workshop Proceedings, vol. 2272. CEUR-WS.org (2018)"},{"key":"31_CR7","unstructured":"Amendola, G.: Solving the stable roommates problem using incoherent answer set programs. In: RiCeRcA@AI*IA. CEUR Workshop Proceedings, vol. 2272 (2018)"},{"key":"31_CR8","unstructured":"Amendola, G.: Towards quantified answer set programming. In: RCRA@FLoC. CEUR Workshop Proceedings, vol. 2271. CEUR-WS.org (2018)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Amendola, G., Dodaro, C., Faber, W., Leone, N., Ricca, F.: On the computation of paracoherent answer sets. In: AAAI, pp. 1034\u20131040 (2017)","DOI":"10.1609\/aaai.v31i1.10679"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Amendola, G., Dodaro, C., Faber, W., Ricca, F.: Externally supported models for efficient computation of paracoherent answer sets. In: AAAI 2018, pp. 1034\u20131040 (2018)","DOI":"10.1609\/aaai.v32i1.11540"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-49130-1_13","volume-title":"AI*IA 2016 Advances in Artificial Intelligence","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Dodaro, C., Leone, N., Ricca, F.: On the application of answer set programming to the conference paper assignment problem. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016. LNCS (LNAI), vol. 10037, pp. 164\u2013178. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49130-1_13"},{"key":"31_CR12","unstructured":"Amendola, G., Dodaro, C., Ricca, F.: ASPQ: an ASP-based 2QBF solver. In: QBF@SAT. CEUR Workshop Proceedings, vol. 1719, pp. 49\u201354 (2016)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.artint.2016.01.011","volume":"234","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Eiter, T., Fink, M., Leone, N., Moura, J.: Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234, 219\u2013271 (2016)","journal-title":"Artif. Intell."},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-319-11558-0_32","volume-title":"Logics in Artificial Intelligence","author":"G Amendola","year":"2014","unstructured":"Amendola, G., Eiter, T., Leone, N.: Modular paracoherent answer sets. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 457\u2013471. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_32"},{"key":"31_CR15","unstructured":"Amendola, G., Greco, G., Leone, N., Veltri, P.: Modeling and reasoning about NTU games via answer set programming. In: IJCAI 2016, pp. 38\u201345 (2016)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: Generating hard random Boolean formulas and disjunctive logic programs. In: IJCAI, pp. 532\u2013538 (2017)","DOI":"10.24963\/ijcai.2017\/75"},{"key":"31_CR17","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: A generator of hard 2QBF formulas and ASP programs. In: KR. AAAI Press (2018)"},{"key":"31_CR18","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: Random models of very hard 2QBF and disjunctive programs: an overview. In: ICTCS. CEUR Workshop Proceedings, CEUR-WS.org (2018)"},{"issue":"2","key":"31_CR19","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. AICOM 24(2), 147\u2013164 (2011)","journal-title":"AICOM"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-14309-0_8","volume-title":"A 25-Year Perspective on Logic Programming","author":"P Bonatti","year":"2010","unstructured":"Bonatti, P., Calimeri, F., Leone, N., Ricca, F.: Answer set programming. In: Dovier, A., Pontelli, E. (eds.) A 25-Year Perspective on Logic Programming. LNCS, vol. 6125, pp. 159\u2013182. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14309-0_8"},{"issue":"12","key":"31_CR21","doi-asserted-by":"publisher","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"},{"issue":"5","key":"31_CR22","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"31_CR23","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10601-010-9095-y","volume":"15","author":"E Rosa Di","year":"2010","unstructured":"Di Rosa, E., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints 15(4), 485\u2013515 (2010)","journal-title":"Constraints"},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S1471068413000598","volume":"15","author":"E Erdem","year":"2015","unstructured":"Erdem, E., \u00d6ztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35\u201378 (2015). https:\/\/doi.org\/10.1017\/S1471068413000598","journal-title":"TPLP"},{"issue":"2","key":"31_CR25","first-page":"137","volume":"19","author":"A Garro","year":"2006","unstructured":"Garro, A., Palopoli, L., Ricca, F.: Exploiting agents in e-learning and skills management context. AI Commun. 19(2), 137\u2013154 (2006)","journal-title":"AI Commun."},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Gebser, M., Leone, N., Maratea, M., Perri, S., Ricca, F., Schaub, T.: Evaluation techniques and systems for answer set programming: a survey. In: IJCAI, pp. 5450\u20135456 (2018)","DOI":"10.24963\/ijcai.2018\/769"},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1613\/jair.5373","volume":"60","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The sixth answer set programming competition. J. Artif. Intell. Res. 60, 41\u201395 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"3\/4","key":"31_CR28","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\u2013386 (1991)","journal-title":"New Gener. Comput."},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-11503-5_5","volume-title":"Practical Aspects of Declarative Languages","author":"G Grasso","year":"2010","unstructured":"Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-based system for team-building in the gioia-tauro seaport. In: Carro, M., Pe\u00f1a, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 40\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11503-5_5"},{"key":"31_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-04238-6_63","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G Grasso","year":"2009","unstructured":"Grasso, G., Iiritano, S., Leone, N., Ricca, F.: Some DLV applications for knowledge management. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 591\u2013597. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_63"},{"key":"31_CR31","unstructured":"Hoos, H., Kaminski, R., Schaub, T., Schneider, M.T.: ASPeed: ASP-based solver scheduling. In: Technical Communications of ICLP 2012. LIPIcs, vol. 17, pp. 176\u2013187 (2012)"},{"issue":"4\u20135","key":"31_CR32","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"},{"issue":"3","key":"31_CR33","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1609\/aimag.v37i3.2675","volume":"37","author":"Y Lierler","year":"2016","unstructured":"Lierler, Y., Maratea, M., Ricca, F.: Systems, engineering environments, and competitions. AI Mag. 37(3), 45\u201352 (2016)","journal-title":"AI Mag."},{"issue":"2","key":"31_CR34","first-page":"227","volume":"13","author":"M Manna","year":"2013","unstructured":"Manna, M., Ricca, F., Terracina, G.: Consistent query answering via ASP from different perspectives: theory and practice. TPLP 13(2), 227\u2013252 (2013)","journal-title":"TPLP"},{"issue":"4\u20135","key":"31_CR35","first-page":"696","volume":"15","author":"M Manna","year":"2015","unstructured":"Manna, M., Ricca, F., Terracina, G.: Taming primary key violations to query large inconsistent data via ASP. TPLP 15(4\u20135), 696\u2013710 (2015)","journal-title":"TPLP"},{"key":"31_CR36","unstructured":"Maratea, M., Pulina, L., Ricca, F.: Applying machine learning techniques to ASP solving. In: Technical Communications of ICLP 2012. LIPIcs, vol. 17, pp. 37\u201348 (2012)"},{"issue":"6","key":"31_CR37","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"},{"issue":"1\u20133","key":"31_CR38","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jalgor.2008.02.006","volume":"63","author":"M Maratea","year":"2008","unstructured":"Maratea, M., Ricca, F., Faber, W., Leone, N.: Look-back techniques and heuristics in DLV: implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63(1\u20133), 70\u201389 (2008)","journal-title":"J. Algorithms"},{"key":"31_CR39","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"issue":"3","key":"31_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/logcom\/5.3.265","volume":"5","author":"C Sakama","year":"1995","unstructured":"Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Log. Comput. 5(3), 265\u2013285 (1995)","journal-title":"J. Log. Comput."},{"issue":"1\u20132","key":"31_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T11:30:16Z","timestamp":1663414216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}