{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:58:25Z","timestamp":1747810705481,"version":"3.40.5"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"unspecified","delay-in-days":19,"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,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of generating incrementally larger ground logic programs equivalent to a given non-ground one; so called<jats:italic>overgrounded programs<\/jats:italic>can be reused in combination with deliberately many different sets of inputs. Updating overgrounded programs requires a small effort, thus making the instantiation of logic programs considerably faster when grounding is repeated on a series of inputs similar to each other. Notably, the proposed approach works \u201cunder the hood\u201d, relieving designers of logic programs from controlling technical aspects of grounding engines and answer set systems. In this work we present the theoretical basis of the proposed incremental grounding technique, we illustrate the consequent repeated evaluation strategy and report about our experiments.<\/jats:p>","DOI":"10.1017\/s1471068419000292","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T09:06:21Z","timestamp":1568970381000},"page":"957-973","source":"Crossref","is-referenced-by-count":7,"title":["Incremental Answer Set Programming with Overgrounding"],"prefix":"10.1017","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0834","authenticated-orcid":false,"given":"FRANCESCO","family":"CALIMERI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIOVAMBATTISTA","family":"IANNI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6632-3492","authenticated-orcid":false,"given":"FRANCESCO","family":"PACENZA","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":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000292_ref10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","article-title":"GASP: answer set programming with lazy grounding","volume":"3","author":"Dal Pal\u00f9","year":"2009","journal-title":"Fundam. Inform. 96"},{"key":"S1471068419000292_ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2672"},{"key":"S1471068419000292_ref27","unstructured":"Nethercote, N. , Stuckey, P. , Becket, R. , Brand, S. , Duck, G. , and Tack, G. 2007. Minizinc: Towards a standard CP modelling language. In CP 2007, pp. 529\u2013543."},{"key":"S1471068419000292_ref15","first-page":"200","volume-title":"JELIA, Volume 3229 of LNCS","author":"Faber","year":"2004"},{"key":"S1471068419000292_ref19","first-page":"345","volume-title":"LPNMR, Volume 6645 of LNCS","author":"Gebser","year":"2011"},{"key":"S1471068419000292_ref4","first-page":"1737","volume-title":"IJCAI 2018, July 13-19, 2018","author":"Bogaerts","year":"2018"},{"key":"S1471068419000292_ref26","unstructured":"Motik, B. , Nenov, Y. , Piro, R. , and Horrocks, I. 2019. Maintenance of datalog materialisations revisited. Artificial Intelligence 269, 76\u2013136."},{"key":"S1471068419000292_ref28","unstructured":"P\u00e9rez-Li\u00e9bana, D. , Samothrakis, S. , Togelius, J. , Schaul, T. , and Lucas, S. 2016. General video game AI: competition, challenges and opportunities. In AAAI 2016, pp. 4335\u20134337."},{"key":"S1471068419000292_ref17","first-page":"368","volume-title":"LPNMR 2015, Volume 9345 of LNCS","author":"Gebser","year":"2015"},{"key":"S1471068419000292_ref29","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"S1471068419000292_ref22","unstructured":"Herbrand, J. 1930. Recherches sur la th\u00e9orie de la d\u00e9monstration."},{"key":"S1471068419000292_ref1","first-page":"40","volume-title":"LPNMR 2015, Volume 9345 of LNCS","author":"Alviano","year":"2015"},{"key":"S1471068419000292_ref16","first-page":"51","article-title":"Consistency of clark\u2019s completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Meth. of Logic in CS 1"},{"key":"S1471068419000292_ref18","first-page":"27","article-title":"Multi-shot ASP solving with clingo","volume":"1","author":"Gebser","year":"2019","journal-title":"TPLP 19"},{"key":"S1471068419000292_ref32","first-page":"191","volume-title":"LPNMR, Volume 10377 of LNCS","author":"Weinzierl","year":"2017"},{"key":"S1471068419000292_ref25","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2630"},{"key":"S1471068419000292_ref8","unstructured":"Calimeri, F. , Ianni, G. , Perri, S. , and Zangari, J. 2013. The eternal battle between determinism and nondeterminism: preliminary studies in the sudoku domain. 20th RCRA International Workshop. 2013."},{"key":"S1471068419000292_ref12","first-page":"480","volume-title":"JELIA, Volume 7519 of LNCS","author":"Dao-Tran","year":"2012"},{"key":"S1471068419000292_ref2","unstructured":"Alviano, M. , Faber, W. , Greco, G. , and Leone, N. 2012. Magic sets for disjunctive datalog programs. Artificial Intelligence 187, 156\u2013192."},{"key":"S1471068419000292_ref3","first-page":"744","article-title":"Ticker: A system for incremental asp-based stream reasoning","volume":"5","author":"Beck","year":"2017","journal-title":"TPLP 17"},{"key":"S1471068419000292_ref5","first-page":"407","volume-title":"ICLP, Volume 5366 of Lecture Notes in Computer Science","author":"Calimeri","year":"2008"},{"key":"S1471068419000292_ref6","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068419000292_ref7","unstructured":"Calimeri, F. , Germano, S. , Ianni, G. , Pacenza, F. , Perri, S. , and Zangari, J. 2018. Integrating rule-based AI tools into mainstream game development. In RuleML+RR 2018, pp. 310\u2013317."},{"key":"S1471068419000292_ref9","unstructured":"Calimeri, F. , Perri, S. , and Zangari, J. 2019. Optimizing answer set computation via heuristic-based decomposition. Theory and Practice of Logic Programming, 1\u201326."},{"key":"S1471068419000292_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068419000292_ref13","unstructured":"De Cat, B. , Denecker, M. , and Stuckey, P. 2012. Lazy model expansion by incremental grounding. In Technical Communications of ICLP 2012, pp. 201\u2013211."},{"key":"S1471068419000292_ref14","first-page":"40","volume-title":"Reasoning Web School 2009, Volume 5689 of LNCS","author":"Eiter","year":"2009"},{"key":"S1471068419000292_ref20","unstructured":"Gebser, M. , Maratea, M. , and Ricca, F. 2017. The sixth answer set programming competition. J. Artif. Intell. Res. 60, 41\u201395."},{"key":"S1471068419000292_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068419000292_ref24","first-page":"266","article-title":"Asperix, a first-order forward chaining approach for answer set computing","volume":"3","author":"Lef\u00e8vre","year":"2017","journal-title":"TPLP 17"},{"volume-title":"Principles of Database and Knowledge-Base Systems, Volume I, Volume 14 of Principles of computer science series","year":"1988","author":"Ullman","key":"S1471068419000292_ref30"},{"key":"S1471068419000292_ref31","first-page":"620","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"3","author":"Van Gelder","year":"1991","journal-title":"Journal of the ACM 38"}],"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\/S1471068419000292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T12:22:18Z","timestamp":1575721338000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000292\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":32,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000292"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000292","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}