{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:05:45Z","timestamp":1757311545675,"version":"3.40.5"},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and\/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. The proposed<jats:italic>overgrounded programs with tailoring<\/jats:italic>(OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, our<jats:italic>tailored simplification<\/jats:italic>technique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance.<\/jats:p>","DOI":"10.1017\/s147106842000040x","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T05:25:42Z","timestamp":1600665942000},"page":"719-734","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":9,"title":["Incremental maintenance of overgrounded logic programs with tailored simplifications"],"prefix":"10.1017","volume":"20","author":[{"given":"Giovambattista","family":"Ianni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6632-3492","authenticated-orcid":false,"given":"Francesco","family":"Pacenza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6418-7711","authenticated-orcid":false,"given":"Jessica","family":"Zangari","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"key":"S147106842000040X_ref2","doi-asserted-by":"crossref","unstructured":"2. Beck, H. , Bierbaumer, B. , Dao-Tran, M. , Eiter, T. , Hellwagner, H. , and Schekotihin, K. Stream reasoning-based control of caching strategies in CCN routers. In ICC 2017, pp. 1\u20136. IEEE.","DOI":"10.1109\/ICC.2017.7996762"},{"key":"S147106842000040X_ref24","doi-asserted-by":"crossref","unstructured":"24. P\u00e9rez-Li\u00e9bana, D. , Samothrakis, S. , Togelius, J. , Schaul, T. , and Lucas, S. General video game AI: competition, challenges and opportunities. In AAAI 2016, pp. 4335\u20134337. AAAI Press.","DOI":"10.1609\/aaai.v30i1.9869"},{"key":"S147106842000040X_ref23","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.artint.2018.12.004","article-title":"Maintenance of datalog materialisations revisited","author":"Motik","year":"2019","journal-title":"Artificial Intelligence 269"},{"key":"S147106842000040X_ref5","doi-asserted-by":"crossref","unstructured":"5. Bomanson, J. , Janhunen, T. , and Weinzierl, A. Enhancing lazy grounding with lazy normalization in answer-set programming. In AAAI 2019, pp. 2694\u20132702. AAAI Press.","DOI":"10.1609\/aaai.v33i01.33012694"},{"key":"S147106842000040X_ref25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10514-018-9721-x","article-title":"Finding optimal feasible global plans for multiple teams of heterogeneous robots using hybrid reasoning: an application to cognitive factories","volume":"1","author":"Saribatur","year":"2019","journal-title":"Autonomous Robots 43"},{"key":"S147106842000040X_ref10","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1017\/S1471068419000292","article-title":"Incremental answer set programming with overgrounding","volume":"5","author":"Calimeri","year":"2019","journal-title":"Theory and Practice of Logic Programming 19"},{"key":"S147106842000040X_ref4","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1017\/S1471068417000370","article-title":"Ticker: A system for incremental ASP-based stream reasoning","volume":"5","author":"Beck","year":"2017","journal-title":"Theory and Practice of Logic Programming 17"},{"key":"S147106842000040X_ref7","doi-asserted-by":"crossref","unstructured":"7. Calimeri, F. , Fusc\u00e0, D. , Perri, S. , and Zangari, J. 2016. I-DLV: The New Intelligent Grounder of DLV. In AIIA, Volume 10037 of LNCS, pp. 192\u2013207. Springer.","DOI":"10.1007\/978-3-319-49130-1_15"},{"key":"S147106842000040X_ref17","first-page":"27","article-title":"Multi-shot ASP solving with clingo","volume":"1","author":"Gebser","journal-title":"Theory and Practice of Logic Programming 19"},{"key":"S147106842000040X_ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v37i3.2672"},{"key":"S147106842000040X_ref1","doi-asserted-by":"crossref","unstructured":"1. Alviano, M. , Dodaro, C. , Leone, N. , and Ricca, F. Advances in WASP. In LPNMR 2015, Volume 9345 of LNCS, pp. 40\u201354. Springer.","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"S147106842000040X_ref19","doi-asserted-by":"crossref","unstructured":"19. Gebser, M. , Kaufmann, B. , and Schaub, T. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 52\u201389.","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S147106842000040X_ref21","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1017\/S1471068416000569","article-title":"Asperix, a first-order forward chaining approach for answer set computing","volume":"3","author":"Lef\u00e8vre","year":"2017","journal-title":"Theory and Practice of Logic Programming 17"},{"key":"S147106842000040X_ref13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/DS-170006","article-title":"Stream reasoning: A survey and outlook","volume":"1","author":"Dell\u2019Aglio","year":"2017","journal-title":"Data Science 1"},{"key":"S147106842000040X_ref26","doi-asserted-by":"crossref","unstructured":"26. Suchan, J. , Bhatt, M. , Walega, P. A. , Schultz, C. P. L. Visual explanation by high-level abduction: On answer-set programming driven reasoning about moving objects. In AAAI 2018, pp. 1965\u20131972. AAAI Press.","DOI":"10.1609\/aaai.v32i1.11569"},{"key":"S147106842000040X_ref3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.artint.2018.04.003","article-title":"LARS: A logic-based framework for analytic reasoning over streams","author":"Beck","year":"2018","journal-title":"Artificial Intelligence 261"},{"key":"S147106842000040X_ref8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/IA-170104","article-title":"I-DLV: The New Intelligent Grounder of DLV","volume":"1","author":"Calimeri","year":"2017","journal-title":"Intelligenza Artificiale 11"},{"key":"S147106842000040X_ref16","doi-asserted-by":"crossref","unstructured":"16. Faber, W. , Leone, N. , and Pfeifer, G. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In JELIA 2004, Volume 3229 of LNCS, pp. 200\u2013212. Springer.","DOI":"10.1007\/978-3-540-30227-8_19"},{"key":"S147106842000040X_ref22","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2630"},{"key":"S147106842000040X_ref12","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2009-180"},{"key":"S147106842000040X_ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409990159"},{"key":"S147106842000040X_ref15","doi-asserted-by":"crossref","unstructured":"15. Faber, W. , Leone, N. , and Perri, S. 2012. The intelligent grounder of DLV. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, Volume 7265 of LNCS, pp. 247\u2013264. Springer.","DOI":"10.1007\/978-3-642-30743-0_17"},{"key":"S147106842000040X_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_37"},{"key":"S147106842000040X_ref9","doi-asserted-by":"crossref","unstructured":"9. Calimeri, F. , Germano, S. , Ianni, G. , Pacenza, F. , Perri, S. , and Zangari, J. Integrating rule-based AI tools into mainstream game development. In RuleML+RR 2018, Volume 11092 of LNCS, pp. 310\u2013317. Springer.","DOI":"10.1007\/978-3-319-99906-7_23"},{"key":"S147106842000040X_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000036"},{"key":"S147106842000040X_ref18","unstructured":"18. Gebser, M. , Kaufmann, B. , Neumann, A. , and Schaub, T. Advanced preprocessing for answer set solving. In ECAI 2008, Volume 178 of FAIA, pp. 15\u201319. IOS Press."},{"key":"S147106842000040X_ref14","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1017\/S1471068419000309","article-title":"A distributed approach to LARS stream reasoning (system paper)","volume":"5","author":"Eiter","year":"2019","journal-title":"Theory and Practice of Logic Programming 19"}],"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\/S147106842000040X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T08:27:26Z","timestamp":1668846446000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106842000040X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["S147106842000040X"],"URL":"https:\/\/doi.org\/10.1017\/s147106842000040x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}