{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:41:38Z","timestamp":1760125298539,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Incremental techniques aim at making it possible to improve the performance of the grounding and solving processes by reusing the results of previous executions. Clingo supports both incremental grounding and incremental solving computations. In order to leverage incremental computations in clingo, the incremental fragments of ASP programs must satisfy certain safety-related conditions. In a number of problem domains and reasoning tasks, these conditions can be satisfied in a fairly straightforward way. However, we have observed that in certain practical applications, satisfying the conditions becomes more challenging, to the point that it is sometimes unclear how or even if it is possible to leverage incremental computations. In this paper, we report our findings, and ultimate success, with the use of incremental grounding and solving techniques in one of these challenging cases. We describe the domain, which is linked to a large practical application, discuss the challenges we faced in attempting to leverage incremental computations, and then describe the techniques that we developed, in particular at the level of methods for encoding the domain knowledge and of algorithms supporting the intended interleaving of grounding and solving. We believe that our findings may provide valuable information to practitioners facing similar challenges and ultimately increase the adoption of clingo\u2019s incremental capabilities for complex practical applications.<\/jats:p>","DOI":"10.3390\/a16030169","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T07:06:37Z","timestamp":1679295997000},"page":"169","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pushing the Limits of Clingo\u2019s Incremental Grounding and Solving Capabilities in Practical Applications"],"prefix":"10.3390","volume":"16","author":[{"given":"Marcello","family":"Balduccini","sequence":"first","affiliation":[{"name":"Elemental Cognition, Inc., New York, NY 10169, USA"},{"name":"Department of Decision & System Sciences, Erivan K. Haub School of Business, Saint Joseph\u2019s University, Philadelphia, PA 19131, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Barborak","sequence":"additional","affiliation":[{"name":"Elemental Cognition, Inc., New York, NY 10169, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Ferrucci","sequence":"additional","affiliation":[{"name":"Elemental Cognition, Inc., New York, NY 10169, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical Negation in Logic Programs and Disjunctive Databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Gener. Comput."},{"key":"ref_2","unstructured":"Marek, V.W., and Truszczynski, M. (1999). The Logic Programming Paradigm: A 25-Year Perspective, Springer."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s13218-018-0548-6","article-title":"Industrial Applications of Answer Set Programming","volume":"32","author":"Falkner","year":"2018","journal-title":"KI\u2013Kunstl. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10472-006-9026-1","article-title":"Answer Set Based Design of Knowledge Systems","volume":"47","author":"Balduccini","year":"2006","journal-title":"Ann. Math. Artif. Intell."},{"key":"ref_5","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., and Schaub, T. (2007, January 6\u201312). Conflict-Driven Answer Set Solving. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI\u201907), Hyderabad, India."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kaminski, R., Schaub, T., and Wanko, P. (2017, January 7\u201311). A Tutorial on Hybrid Answer Set Solving with Clingo. Proceedings of the Thirteenth International Summer School of the Reasoning Web (RW-2017), London, UK.","DOI":"10.1007\/978-3-319-61033-7_6"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S1471068418000054","article-title":"Multi-shot ASP Solving with Clingo","volume":"19","author":"Gebser","year":"2019","journal-title":"J. Theory Pract. Log. Program. (TPLP)"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Russo, C., and Zhou, N.F. (2012, January 23\u201324). ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding. Proceedings of the Fourteenth International Symposium on Practical Aspects of Declarative Languages (PADL 2012), Philadelphia, PA, USA. Number 7149 in Lecture Notes in Artificial Intelligence (LNCS).","DOI":"10.1007\/978-3-642-27694-1"},{"key":"ref_9","unstructured":"Oikarinen, E., and Janhunen, T. (2006, January 1). Modular Equivalence for Normal Logic Programs. Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI\u201906), Riva del Garda, Italy."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","article-title":"Modularity Aspects of Disjunctive Stable Models","volume":"35","author":"Janhunen","year":"2009","journal-title":"J. Artif. Intell. Res."},{"key":"ref_11","first-page":"193","article-title":"Action Languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electron. Trans. AI"},{"key":"ref_12","unstructured":"Baral, C., and Gelfond, M. (2000). Logic-Based Artificial Intelligence, Springer."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Balduccini, M. (2022, January 17\u201318). People, Ideas, and the Path Ahead. Proceedings of the 24th International Symposium on Practical Aspects of Declarative Languages (PADL 2022), Philadelphia, PA, USA. Lecture Notes in Artificial Intelligence (LNCS).","DOI":"10.1007\/978-3-030-94479-7_1"},{"key":"ref_14","unstructured":"(2023, January 10). Available online: https:\/\/www.billboard.com\/pro\/super-bowl-halftime-show-covid-safety-coronavirus\/."},{"key":"ref_15","unstructured":"(2023, January 10). Available online: https:\/\/www.cdc.gov\/coronavirus\/2019-ncov\/community\/guidance-business-response.html."},{"key":"ref_16","unstructured":"McCarthy, J. (2023, January 10). Programs with Common Sense. In Proceedings of the Teddington Conference on the Mechanization of Thought Processes, London, Her Majesty\u2019s Stationary Office. Available online: https:\/\/books.google.com.hk\/books?hl=zh-CN&lr=&id=ig8mHog30X0C&oi=fnd&pg=PA54&dq=%7BPrograms+with+%7BCommon+%7BSense.&ots=fmkH502LFW&sig=Bvb--R1ln9kYZ8TMMEG2lWg0_pI&redir_esc=y#v=onepage&q=%7BPrograms%20with%20%7BCommon%20%7BSense.&f=false."},{"key":"ref_17","unstructured":"Meltzer, B., and Michie, D. (1969). Machine Intelligence 4, Edinburgh University Press."},{"key":"ref_18","unstructured":"Balduccini, M. (2005). Answer Set Based Design of Highly Autonomous, Rational Agents. [Ph.D. Thesis, Texas Tech University]."},{"key":"ref_19","unstructured":"Balduccini, M., and Son, T.C. (2011). Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, Springer. Lecture Notes in Artificial Intelligence (LNCS)."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1017\/S1471068417000102","article-title":"Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter","volume":"17","author":"Balduccini","year":"2017","journal-title":"J. Theory Pract. Log. Program. (TPLP)"},{"key":"ref_21","unstructured":"Lee, J., and Lifschitz, V. (2001, January 26\u201328). Additive Fluents. Proceedings of the Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1017\/S1471068403001807","article-title":"Diagnostic reasoning with A-Prolog","volume":"3","author":"Balduccini","year":"2003","journal-title":"J. Theory Pract. Log. Program. (TPLP)"},{"key":"ref_23","unstructured":"McCain, N. (1997). Causality in Commonsense Reasoning about Actions. [Ph.D. Thesis, University of Texas]."},{"key":"ref_24","unstructured":"Kamp, J. (1968). Tense Logic and the Theory of Linear Order. [Ph.D. Thesis, University of California]."},{"key":"ref_25","unstructured":"Pnueli, A. (November, January 31). The Temporal Logic of Programs. Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, RI, USA."},{"key":"ref_26","unstructured":"Giacomo, G.D., and Vardi, M. (2013, January 3\u20139). Linear temporal logic and linear dynamic logic on finite traces. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, Beijing China."},{"key":"ref_27","unstructured":"Giacomo, G.D., Stasio, A.D., Fuggitti, F., and Sasha, R. (2020, January 7\u201315). Pure-Past Linear Temporal and Dynamic Logic on Finite Traces. Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, Yokohama, Japan."},{"key":"ref_28","unstructured":"Giacomo, G.D., Murano, A., Patrizi, F., and Perelli, G. (2021, January 3\u201312). Timed Trace Alignment with Metric Temporal Logic over Finite Traces. Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, Online."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1017\/S1471068421000557","article-title":"Linear-Time Temporal Answer Set Programming","volume":"23","author":"Aguado","year":"2023","journal-title":"J. Theory Pract. Log. Program. (TPLP)"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1017\/S1471068419000292","article-title":"Incremental Answer Set Programming with Overgrounding","volume":"19","author":"Calimeri","year":"2019","journal-title":"J. Theory Pract. Log. Program. (TPLP)"},{"key":"ref_31","unstructured":"Cabalar, P., and Terracina, G. (2021, January 8\u201315). An Answer Set Programming Based Framework for High-Utility Pattern Mining Extended with Facets and Advanced Utility Functions. Proceedings of the Rules and Reasoning: 5th International Joint Conference (RuleML + RR 2021), Online."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/169\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:59:26Z","timestamp":1760122766000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,20]]},"references-count":31,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["a16030169"],"URL":"https:\/\/doi.org\/10.3390\/a16030169","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,3,20]]}}}