{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:51:00Z","timestamp":1765486260475,"version":"3.40.5"},"reference-count":54,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:p>We present <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068418000546_inline1\"\/><jats:tex-math>${{{{$\\mathscr{I}$}-}\\textsc{dlv}}+{{$\\mathscr{MS}$}}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, a new answer set programming (ASP) system that integrates an efficient grounder, namely <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068418000546_inline2\"\/><jats:tex-math>${{{$\\mathscr{I}$}-}\\textsc{dlv}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, with an automatic selector that inductively chooses a solver: depending on some inherent features of the instantiation produced by <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1471068418000546_inline3\"\/><jats:tex-math>${{{$\\mathscr{I}$}-}\\textsc{dlv}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, machine learning techniques guide the selection of the most appropriate solver. The system participated in the latest (7<jats:sup>th<\/jats:sup>) ASP competition, winning the regular track, category <jats:italic>SP<\/jats:italic> (i.e., one processor allowed).<\/jats:p>","DOI":"10.1017\/s1471068418000546","type":"journal-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T03:23:22Z","timestamp":1543893802000},"page":"205-224","source":"Crossref","is-referenced-by-count":12,"title":["Efficiently Coupling the I-DLV Grounder with ASP Solvers"],"prefix":"10.1017","volume":"20","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-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVIDE","family":"FUSC\u00c0","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"}]},{"given":"JESSICA","family":"ZANGARI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"S1471068418000546_ref45","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841100007X"},{"key":"S1471068418000546_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23264-5_31"},{"key":"S1471068418000546_ref16","first-page":"480","volume-title":"European Conference on Logics in Artificial Intelligence. Lecture Notes in Computer Science","volume":"7519","author":"Dao-Tran","year":"2012"},{"key":"S1471068418000546_ref52","volume-title":"Principles of Database and Knowledge-Base Systems","volume":"I","author":"Ullman","year":"1988"},{"key":"S1471068418000546_ref50","unstructured":"Syrj\u00e4nen, T. 2002. Lparse 1.0 user\u2019s manual. URL: http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz. [Accessed on March 20, 2018]."},{"key":"S1471068418000546_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.008"},{"key":"S1471068418000546_ref29","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5373"},{"key":"S1471068418000546_ref48","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000035301.49549.88"},{"key":"S1471068418000546_ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068418000546_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22002-4_7"},{"key":"S1471068418000546_ref31","first-page":"1070","volume-title":"International Conference and Symposium on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068418000546_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068418000546_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24609-1_32"},{"key":"S1471068418000546_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73305-0_9"},{"key":"S1471068418000546_ref14","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2009-180"},{"key":"S1471068418000546_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_1"},{"key":"S1471068418000546_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068418000546_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068418000546_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_24"},{"key":"S1471068418000546_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068418000546_ref4","article-title":"Optimum stable model search: Algorithms and implementation","author":"Alviano","year":"2015","journal-title":"Journal of Logic and Computation"},{"key":"S1471068418000546_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_17"},{"key":"S1471068418000546_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000569"},{"key":"S1471068418000546_ref8","unstructured":"Calimeri, F. , Faber, W. , Gebser, M. , Ianni, G. , Kaminski, R. , Krennwallner, T. , Leone, N. , Ricca, F. and Schaub, T. 2012. Asp-core-2: Input language format. ASP Standardization Working Group. Technical Report."},{"key":"S1471068418000546_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841600020X"},{"key":"S1471068418000546_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"S1471068418000546_ref36","first-page":"25:1","article-title":"Auto-weka 2.0: Automatic model selection and hyperparameter optimization in WEKA","volume":"18","author":"Kotthoff","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"S1471068418000546_ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"S1471068418000546_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45241-9_12"},{"key":"S1471068418000546_ref9","unstructured":"Calimeri, F. , Fusc\u00e0, D. , Perri, S. and Zangari, J. since 2016. ${{{$\\mathscr{I}$}-}\\textsc{dlv}}$ homepage. URL: https:\/\/github.com\/DeMaCS-UNICAL\/I-DLV\/wiki. [Accessed on March 20, 2018]."},{"key":"S1471068418000546_ref34","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000210"},{"key":"S1471068418000546_ref10","unstructured":"Calimeri, F. , Fusc\u00e0, D. , Perri, S. and Zangari, J. since 2017. ${{{{$\\mathscr{I}$}-}\\textsc{dlv}}+{{$\\mathscr{MS}$}}}$ homepage. URL: https:\/\/github.com\/DeMaCS-UNICAL\/IDLV-MS. [Accessed on March 20, 2018]."},{"volume-title":"AAAI Conference on Artificial Intelligence","year":"2016","author":"Gebser","key":"S1471068418000546_ref27"},{"key":"S1471068418000546_ref23","first-page":"16","volume-title":"Technical Communications of the International Conference on Logic Programming","volume":"52","author":"Gebser","year":"2016"},{"key":"S1471068418000546_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841400009X"},{"key":"S1471068418000546_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2008.02.006"},{"key":"S1471068418000546_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_39"},{"key":"S1471068418000546_ref21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt662"},{"key":"S1471068418000546_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068418000546_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_63"},{"key":"S1471068418000546_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_17"},{"key":"S1471068418000546_ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2672"},{"key":"S1471068418000546_ref39","first-page":"308","volume-title":"International Summer School on Reasoning Web","volume":"9203","author":"Leone","year":"2015"},{"key":"S1471068418000546_ref41","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000094"},{"key":"S1471068418000546_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"S1471068418000546_ref17","first-page":"99","volume-title":"Italian Conference on Computational Logic. CEUR Workshop Proceedings","volume":"810","author":"Dodaro","year":"2011"},{"key":"S1471068418000546_ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"S1471068418000546_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_19"},{"key":"S1471068418000546_ref54","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"S1471068418000546_ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9051-2"},{"key":"S1471068418000546_ref11","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068418000546_ref51","first-page":"19","volume-title":"International Conference on Engineering Design","author":"Tiihonen","year":"2003"},{"key":"S1471068418000546_ref49","first-page":"267","volume-title":"International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science","volume":"2173","author":"Syrj\u00e4nen","year":"2001"},{"key":"S1471068418000546_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000284"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068418000546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T06:45:08Z","timestamp":1581489908000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000546\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["S1471068418000546"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000546","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2018,12,4]]}}}