{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:02:24Z","timestamp":1740135744755,"version":"3.37.3"},"reference-count":68,"publisher":"Cambridge University Press (CUP)","issue":"3-4","license":[{"start":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T00:00:00Z","timestamp":1533859200000},"content-version":"unspecified","delay-in-days":40,"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":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Aggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. This paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. The proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given.<\/jats:p>","DOI":"10.1017\/s1471068418000133","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T09:44:17Z","timestamp":1533894257000},"page":"301-318","source":"Crossref","is-referenced-by-count":6,"title":["Shared aggregate sets in answer set programming"],"prefix":"10.1017","volume":"18","author":[{"given":"MARIO","family":"ALVIANO","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"CARMINE","family":"DODARO","sequence":"additional","affiliation":[]},{"given":"MARCO","family":"MARATEA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"doi-asserted-by":"publisher","key":"S1471068418000133_ref61","DOI":"10.1609\/aimag.v37i3.2671"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref46","DOI":"10.1017\/S1471068403001923"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref5","DOI":"10.3233\/FI-2016-1441"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref47","DOI":"10.1017\/S1471068415000150"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref22","DOI":"10.1017\/S147106841300001X"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref2","DOI":"10.1613\/jair.3653"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref33","DOI":"10.1007\/978-3-642-40564-8_19"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref64","DOI":"10.1016\/j.artint.2009.11.016"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref68","DOI":"10.1017\/S1471068406002936"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref17","DOI":"10.1017\/S1471068415000228"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref32","DOI":"10.1007\/978-3-319-23264-5_13"},{"key":"S1471068418000133_ref31","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-319-11558-0_12","volume-title":"European Conference on Logics in Artificial Intelligence","author":"Bomanson","year":"2014"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref28","DOI":"10.1017\/S1471068417000138"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref53","DOI":"10.1016\/j.artint.2012.04.001"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref9","DOI":"10.1017\/S147106841600020X"},{"key":"S1471068418000133_ref21","first-page":"879","volume-title":"AAAI Conference on Artificial Intelligence","author":"Alviano","year":"2016"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref37","DOI":"10.1016\/j.artint.2015.09.008"},{"key":"S1471068418000133_ref42","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-2011-408","article-title":"Look-back techniques for ASP programs with aggregates","volume":"107","author":"Faber","year":"2011","journal-title":"Fundamenta Informaticae"},{"unstructured":"Calimeri F. , Faber W. , Gebser M. , Ianni G. , Kaminski R. , Krennwallner T. , Leone N. , Ricca F. , and Schaub T. 2013. ASP-Core-2 Input Language Format.","key":"S1471068418000133_ref36"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref67","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068418000133_ref14","first-page":"2677","volume-title":"International Joint Conference on Artificial Intelligence","author":"Alviano","year":"2015"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref16","DOI":"10.1007\/978-3-642-40564-8_7"},{"unstructured":"Dodaro C. , Alviano M. , Faber W. , Leone N. , Ricca F. , and Sirianni M. 2011. The birth of a WASP: preliminary report on a new ASP solver. In Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 810. CEUR-WS.org, 99\u2013113.","key":"S1471068418000133_ref39"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref63","DOI":"10.1609\/aimag.v37i3.2670"},{"unstructured":"Bartholomew M. , Lee J. , and Meng Y. 2011. First-order semantics of aggregates in answer set programming via modified circumscription. In Logical Formalizations of Commonsense Reasoning AAAI Spring Symposium. AAAI.","key":"S1471068418000133_ref29"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref7","DOI":"10.1007\/978-3-319-61660-5_19"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref58","DOI":"10.1007\/s10472-009-9113-1"},{"key":"S1471068418000133_ref4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/IA-2011-0023","article-title":"Efficient recursive aggregate evaluation in logic programming","volume":"5","author":"Alviano","year":"2011","journal-title":"Intelligenza Artificiale"},{"key":"S1471068418000133_ref25","first-page":"4105","volume-title":"International Joint Conference on Artificial Intelligence","author":"Alviano","year":"2016"},{"key":"S1471068418000133_ref10","first-page":"886","volume-title":"International Joint Conference on Artificial Intelligence","author":"Alviano","year":"2016"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref34","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068418000133_ref20","first-page":"282","volume-title":"Datalog Reloaded","author":"Alviano","year":"2010"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref66","DOI":"10.1017\/S1471068406002973"},{"key":"S1471068418000133_ref15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/AIC-2011-0492","article-title":"Dynamic magic sets and super-coherent answer set programs","volume":"24","author":"Alviano","year":"2011","journal-title":"AI Communications"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref23","DOI":"10.1007\/978-3-642-20895-9_14"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref50","DOI":"10.1007\/978-3-642-20895-9_39"},{"key":"S1471068418000133_ref41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"Translating pseudo-boolean constraints into SAT","volume":"2","author":"E\u00e9n","year":"2006","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref38","DOI":"10.1017\/S1471068417000254"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref35","DOI":"10.1017\/S147106841400009X"},{"unstructured":"Aavani A. , Mitchell D. G. , and Ternovska E. 2013. New encoding for translating pseudo-boolean constraints into SAT. In Symposium on Abstraction, Reformulation, and Approximation. AAAI.","key":"S1471068418000133_ref1"},{"key":"S1471068418000133_ref56","first-page":"1070","volume-title":"Logic Programming","author":"Gelfond","year":"1988"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref6","DOI":"10.1007\/978-3-642-40564-8_5"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref3","DOI":"10.1007\/978-3-642-33558-7_8"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref24","DOI":"10.1017\/S147106841500023X"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref30","DOI":"10.1007\/11562931_7"},{"key":"S1471068418000133_ref26","first-page":"211","volume-title":"Technical Communications of the International Conference on Logic Programming","author":"Andres","year":"2012"},{"key":"S1471068418000133_ref27","first-page":"181","volume-title":"The International Conferences on Theory and Applications of Satisfiability Testing","author":"Bailleux","year":"2009"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref57","DOI":"10.1017\/S1471068414000222"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref49","DOI":"10.1007\/978-3-642-02846-5_23"},{"volume-title":"International Joint Conference on Artificial Intelligence","year":"2013","author":"Gebser","key":"S1471068418000133_ref54"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref45","DOI":"10.1145\/1970398.1970401"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref40","DOI":"10.1017\/S1471068416000284"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref60","DOI":"10.3166\/jancl.16.35-86"},{"doi-asserted-by":"crossref","unstructured":"Alviano M. , Dodaro C. , Faber W. , Leone N. , and Ricca F. 2013. WASP: A native ASP solver based on constraint learning. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 8148. Springer, 54\u201366.","key":"S1471068418000133_ref12","DOI":"10.1007\/978-3-642-40564-8_6"},{"key":"S1471068418000133_ref18","first-page":"4100","volume-title":"International Joint Conference on Artificial Intelligence","author":"Alviano","year":"2016"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref52","DOI":"10.1007\/978-3-642-04238-6_50"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref43","DOI":"10.1016\/j.artint.2010.04.002"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref55","DOI":"10.1613\/jair.5373"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref65","DOI":"10.1145\/1217856.1217859"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref48","DOI":"10.1007\/978-3-319-23264-5_31"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref19","DOI":"10.1016\/j.artint.2012.04.008"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref13","DOI":"10.1007\/978-3-319-23264-5_5"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref59","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068418000133_ref8","first-page":"487","article-title":"Unfounded sets and well-founded semantics of answer set programs with aggregates","volume":"42","author":"Alviano","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"doi-asserted-by":"crossref","unstructured":"Alviano M. and Dodaro C. 2017. Unsatisfiable core shrinking for anytime answer set optimization. In International Joint Conference on Artificial Intelligence. ijcai.org, 4781\u20134785.","key":"S1471068418000133_ref11","DOI":"10.24963\/ijcai.2017\/666"},{"doi-asserted-by":"publisher","key":"S1471068418000133_ref44","DOI":"10.1017\/S1471068408003323"},{"volume-title":"AAAI Conference on Artificial Intelligence","year":"2013","author":"Gebser","key":"S1471068418000133_ref51"},{"key":"S1471068418000133_ref62","first-page":"346","volume-title":"International Conference on Logic Programming and Nonmonotonic Reasoning","author":"Lierler","year":"2004"}],"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\/S1471068418000133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T15:08:45Z","timestamp":1604761725000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000133\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":68,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S1471068418000133"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000133","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}