{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:05:05Z","timestamp":1768251905896,"version":"3.49.0"},"reference-count":46,"publisher":"Cambridge University Press (CUP)","issue":"04","license":[{"start":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T00:00:00Z","timestamp":1551312000000},"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":[[2019,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Answer Set Programming (ASP) is a purely declarative formalism developed in the field of logic programming and non-monotonic reasoning: computational problems are encoded by logic programs whose answer sets, corresponding to solutions, are computed by an ASP system. Different, semantically equivalent, programs can be defined for the same problem; however, performance of systems evaluating them might significantly vary. We propose an approach for automatically transforming an input logic program into an equivalent one that can be evaluated more efficiently. One can make use of existing tree-decomposition techniques for rewriting selected rules into a set of multiple ones; the idea is to guide and adaptively apply them on the basis of proper new heuristics, to obtain a smart rewriting algorithm to be integrated into an ASP system. The method is rather general: it can be adapted to any system and implement different preference policies. Furthermore, we define a set of new heuristics tailored at optimizing grounding, one of the main phases of the ASP computation; we use them in order to implement the approach into the ASP system<jats:italic>DLV<\/jats:italic>, in particular into its grounding subsystem<jats:italic>\u2110-DLV<\/jats:italic>, and carry out an extensive experimental activity for assessing the impact of the proposal.<\/jats:p>","DOI":"10.1017\/s1471068419000036","type":"journal-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T09:52:30Z","timestamp":1551347550000},"page":"603-628","source":"Crossref","is-referenced-by-count":12,"title":["Optimizing Answer Set Computation via Heuristic-Based Decomposition"],"prefix":"10.1017","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0834","authenticated-orcid":false,"given":"FRANCESCO","family":"CALIMERI","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-5709","authenticated-orcid":false,"given":"SIMONA","family":"PERRI","sequence":"additional","affiliation":[]},{"given":"JESSICA","family":"ZANGARI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,2,28]]},"reference":[{"key":"S1471068419000036_ref39","first-page":"23","volume-title":"Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 \u2013 December 4","author":"Lifschitz","year":"1999"},{"key":"S1471068419000036_ref40","first-page":"247","volume-title":"Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4\u20138, 2012, Budapest, Hungary","author":"Morak","year":"2012"},{"key":"S1471068419000036_ref37","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-45402-0_21","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17\u201319, 2001","author":"Leone","year":"2001"},{"key":"S1471068419000036_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000338"},{"key":"S1471068419000036_ref7","first-page":"114","volume-title":"Logic-Based Program Synthesis and Transformation \u2013 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6\u20138, 2016, Revised Selected Papers","volume":"10184","author":"Bichler","year":"2016"},{"key":"S1471068419000036_ref36","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000569"},{"key":"S1471068419000036_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00060-X"},{"key":"S1471068419000036_ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2672"},{"key":"S1471068419000036_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"S1471068419000036_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1119439.1119440"},{"key":"S1471068419000036_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.008"},{"key":"S1471068419000036_ref33","first-page":"37","volume-title":"Proceedings of Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27\u201331, 2001","author":"Gottlob","year":"2001"},{"key":"S1471068419000036_ref3","first-page":"40","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27\u201330, 2015","author":"Alviano","year":"2015"},{"key":"S1471068419000036_ref32","first-page":"1","volume-title":"Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23\u201325, 2005, Revised Selected Papers","author":"Gottlob","year":"2005"},{"key":"S1471068419000036_ref2","first-page":"215","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 14th International Conference, LPNMR 2017, Espoo, Finland, July 3\u20136, 2017","author":"Alviano","year":"2017"},{"key":"S1471068419000036_ref31","first-page":"57","volume-title":"Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26\u2013July 01, 2016","author":"Gottlob","year":"2016"},{"key":"S1471068419000036_ref1","first-page":"376","volume-title":"Proceedings of Integration of AI and OR Techniques in Constraint Programming \u2013 14th International Conference, CPAIOR 2017, Padua, Italy, June 5\u20138, 2017","author":"Abseher","year":"2017"},{"key":"S1471068419000036_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068419000036_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068419000036_ref28","first-page":"3","volume-title":"Logic Programming and Nonmonotonic Reasoning \u2013 14th International Conference, LPNMR 2017, Espoo, Finland, July 3\u20136, 2017","author":"Gebser","year":"2017"},{"key":"S1471068419000036_ref27","first-page":"4327","volume-title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12\u201317, 2016, Phoenix, Arizona, USA","author":"Gebser","year":"2016"},{"key":"S1471068419000036_ref26","first-page":"531","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27\u201330, 2015","author":"Gebser","year":"2015"},{"key":"S1471068419000036_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068419000036_ref24","first-page":"345","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16\u201319, 2011","author":"Gebser","year":"2011"},{"key":"S1471068419000036_ref22","first-page":"368","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27\u201330, 2015","author":"Gebser","year":"2015"},{"key":"S1471068419000036_ref21","first-page":"26","volume-title":"Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 co-located with the 16th International Conference of the Italian Association for Artificial Intelligen","author":"Fusc\u00e0","year":"2017"},{"key":"S1471068419000036_ref20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-30743-0_17","volume-title":"Correct Reasoning \u2013 Essays on Logic-Based AI in Honour of Vladimir Lifschitz","author":"Faber","year":"2012"},{"key":"S1471068419000036_ref50","first-page":"191","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning \u2013 14th International Conference, LPNMR 2017, Espoo, Finland, July 3\u20136, 2017","author":"Weinzierl","year":"2017"},{"key":"S1471068419000036_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"S1471068419000036_ref49","first-page":"302","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6\u20138, 2004","author":"Ward","year":"2004"},{"key":"S1471068419000036_ref17","first-page":"480","volume-title":"Proceedings of Logics in Artificial Intelligence \u2013 13th European Conference, JELIA 2012, Toulouse, France, September 26\u201328, 2012","author":"Dao-Tran","year":"2012"},{"key":"S1471068419000036_ref48","volume-title":"Principles of Database and Knowledge-Base Systems, Volume I","author":"Ullman","year":"1988"},{"key":"S1471068419000036_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068419000036_ref47","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-45402-0_20","volume-title":"Proceedings of Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17\u201319, 2001","author":"Syrj\u00e4nen","year":"2001"},{"key":"S1471068419000036_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2008.02.003"},{"key":"S1471068419000036_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068419000036_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.008"},{"key":"S1471068419000036_ref45","first-page":"135","volume-title":"Practical Aspects of Declarative Languages - 20th International Symposium, PADL 2018, Los Angeles, CA, USA, January 8-9, 2018, Proceedings","author":"Simona","year":"2018"},{"key":"S1471068419000036_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068419000036_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"S1471068419000036_ref12","volume-title":"PAoASP","author":"Calimeri","year":"2017"},{"key":"S1471068419000036_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-008-9090-9"},{"key":"S1471068419000036_ref42","first-page":"253","volume":"13","author":"Perri","year":"2013","journal-title":"TPLP"},{"key":"S1471068419000036_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068419000036_ref41","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","volume":"96","author":"Pal\u00f9","year":"2009","journal-title":"Fundamenta Informaticae"},{"key":"S1471068419000036_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"}],"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\/S1471068419000036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T21:07:40Z","timestamp":1606597660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000036\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,28]]},"references-count":46,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S1471068419000036"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000036","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,28]]}}}