{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T14:10:01Z","timestamp":1749478201215,"version":"3.41.0"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T00:00:00Z","timestamp":1738800000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The representation of a temporal problem in answer set programming (ASP) usually boils down to using copies of variables and constraints, one for each time stamp, no matter whether it is directly encoded or expressed via an action or temporal language. The multiplication of variables and constraints is commonly done during grounding, and the solver is completely ignorant about the temporal relationship among the different instances. On the other hand, a key factor in the performance of today\u2019s ASP solvers is conflict-driven constraint learning. Our question in this paper is whether a constraint learned for particular time steps can be generalized and reused at other time steps, and ultimately whether this enhances the overall solver performance on temporal problems. Knowing well the domain of time, we study conditions under which learned dynamic constraints can be generalized. Notably, we identify a property of temporal representations that enables the generalization of learned constraints across all time steps. It turns out that most ASP planning encodings either satisfy this property or can be easily adapted to do so. In addition, we propose a general translation that transforms programs to fulfill this property. Finally, we empirically evaluate the impact of adding the generalized constraints to an ASP solver.<\/jats:p>","DOI":"10.1017\/s1471068424000462","type":"journal-article","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T03:46:16Z","timestamp":1738813576000},"page":"197-224","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["On the Generalization of Learned Constraints for ASP Solving in Temporal Domains"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5546-9939","authenticated-orcid":false,"given":"JAVIER","family":"ROMERO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3288-8978","authenticated-orcid":false,"given":"KLAUS","family":"STRAUCH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,2,6]]},"reference":[{"key":"S1471068424000462_ref2","unstructured":"Audemard, G. and Simon, L. 2009. Predicting learnt clauses quality in modern SAT solvers. In Proc. of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI\u201909). Boutilier, C. , Ed. AAAI\/MIT Press, 399\u2013404"},{"key":"S1471068424000462_ref13","unstructured":"Gebser, M. , Kaufmann, B. , Neumann, A. and Schaub, T. 2007. Conflict-driven answer set solving. In Proc. of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI\u201907). Veloso, M. , Ed. AAAI\/MIT Press, 386\u2013392"},{"key":"S1471068424000462_ref9","first-page":"557","volume-title":"Frontiers in Artificial Intelligence and Applications","author":"Dodaro","year":"2023"},{"key":"S1471068424000462_ref15","first-page":"193","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068424000462_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000368"},{"key":"S1471068424000462_ref14","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the Fifth International Conference and Symposium of Logic Programming (ICLP\u201988). Kowalski, R. and Bowen, K. , Eds. MIT Press, 1070\u20131080"},{"key":"S1471068424000462_ref11","first-page":"15","volume-title":"Technical Communications of the Thirty-Second International Conference On Logic Programming (ICLP\u201916)","volume":"52-9","author":"Gebser","year":"2016"},{"key":"S1471068424000462_ref19","first-page":"5834","volume-title":"AAAI","author":"Mazzotta","year":"2022"},{"key":"S1471068424000462_ref1","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.798985"},{"key":"S1471068424000462_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000583"},{"key":"S1471068424000462_ref16","unstructured":"Lee, J. , Lifschitz, V. and Yang, F. 2013. Action language BC: Preliminary report. In Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI\u201913). Rossi, F. , Ed. IJCAI\/AAAI Press, 983\u2013989"},{"key":"S1471068424000462_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000569"},{"key":"S1471068424000462_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.08.002"},{"key":"S1471068424000462_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20528-7_19"},{"key":"S1471068424000462_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"S1471068424000462_ref20","unstructured":"Mcdermott, D. (1998). PDDL \u2014 the planning domain definition language. Technical Report CVC TR-98-003\/DCS TR-1165, Yale Center for Computational Vision and Control"},{"key":"S1471068424000462_ref3","unstructured":"Cabalar, P. , Di\u00e9guez, M. , Hahn, S. and Schaub, T. 2021. Automata for dynamic answer set solving: Preliminary report. In Proc. of the Fourteenth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP\u201921). Arias, Joaqu\u00edn , D\u2019Asaro, Fabio Aurelio , Dyoub, Abeer , Gupta, Gopal , Hecher, Markus , LeBlanc, Emily , Pe\u00f1aloza, Rafael , Salazar, Elmer , Saptawijaya, Ari , Weitk\u00e4mper, Felix and Zangari, Jessic , Ed. CEUR-WS.org."},{"volume-title":"Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning","year":"2012","author":"Gebser","key":"S1471068424000462_ref12"},{"key":"S1471068424000462_ref18","unstructured":"Lifschitz, V. and Turner, H. 1994. Splitting a logic program. (Proceedings of the Eleventh International Conference on Logic Programming, MIT Press, 23\u201337."},{"key":"S1471068424000462_ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/234"},{"key":"S1471068424000462_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61660-5_26"},{"key":"S1471068424000462_ref21","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2009-180"},{"key":"S1471068424000462_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000332"},{"key":"S1471068424000462_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21541-4_2"}],"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\/S1471068424000462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T13:40:33Z","timestamp":1749476433000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000462\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["S1471068424000462"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000462","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2025,2,6]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}