{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T13:00:17Z","timestamp":1761310817943,"version":"build-2065373602"},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"unspecified","delay-in-days":57,"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,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Reasoning about dynamic systems with a fine-grained temporal and numeric resolution presents significant challenges for logic-based approaches like Answer Set Programming (ASP). To address this, we introduce and elaborate upon a novel temporal and constraint-based extension of the logic of Here-and-There and its nonmonotonic equilibrium extension, representing, to the best of our knowledge, the first approach to nonmonotonic temporal reasoning with constraints specifically tailored for ASP. This expressive system is achieved by a synergistic combination of two foundational ASP extensions: the linear-time logic of Here-and-There, providing robust nonmonotonic temporal reasoning capabilities, and the logic of Here-and-There with constraints, enabling the direct integration and manipulation of numeric constraints, among others. This work establishes the foundational logical framework for tackling complex dynamic systems with high resolution within the ASP paradigm.<\/jats:p>","DOI":"10.1017\/s1471068425100203","type":"journal-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T09:34:45Z","timestamp":1756287285000},"page":"579-594","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Towards Constraint Temporal Answer Set Programming"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7440-0953","authenticated-orcid":false,"given":"PEDRO","family":"CABALAR","sequence":"first","affiliation":[{"name":"University of Corunna"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3440-4348","authenticated-orcid":false,"given":"MART\u00cdN","family":"DI\u00c9GUEZ","sequence":"additional","affiliation":[{"name":"University of Angers"}]},{"given":"FRAN\u00c7OIS","family":"OLIVIER","sequence":"additional","affiliation":[{"name":"CRIL CNRS & Artois University"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[{"name":"University of Potsdam Potassco Solutions"}]},{"given":"IGOR","family":"ST\u00c9PHAN","sequence":"additional","affiliation":[{"name":"University of Angers"}]}],"member":"56","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"volume-title":"Constraint Processing","year":"2003","author":"Dechter","key":"S1471068425100203_ref10"},{"key":"S1471068425100203_ref21","unstructured":"Wolter, F. and Zakharyaschev, M. 2000. Spatio-temporal representation and reasoning based on RCC-8. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR\u201900), Cohn, A. , Giunchiglia, F. and Selman, B. , Eds. Morgan Kaufmann Publishers, 3\u201314."},{"key":"S1471068425100203_ref3","doi-asserted-by":"crossref","unstructured":"Balbiani, P. and Condotta, J. 2002. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In Proceedings of the Fourth International Workshop on Frontiers of Combining Systems (FroCoS\u201902), Armando, A. , Ed. Vol. 2309 of Lecture Notes in Computer Science, Springer-Verlag, 162\u2013176.","DOI":"10.1007\/3-540-45988-X_13"},{"key":"S1471068425100203_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068424000139"},{"key":"S1471068425100203_ref17","unstructured":"Lifschitz, V. 2008. What is answer set programming? In Proceedings of the Twenty-third National Conference on Artificial Intelligence (AAAI\u201908), Fox, D. and Gomes, C. , Eds. AAAI Press, 1594\u20131597."},{"key":"S1471068425100203_ref9","doi-asserted-by":"publisher","DOI":"10.5555\/3060621.3060762"},{"key":"S1471068425100203_ref2","unstructured":"Balbiani, P. and Condotta, J. 2001. Une logique pour le raisonnement spatio-temporel bas\u00e9e sur PLTL et l\u2019alg\u00e8bre des rectangles. In Journ\u00e9es Nationales sur les Mod\u00e8les de Raisonnement (JNMR\u201901), 9\u201322."},{"key":"S1471068425100203_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.02.019"},{"key":"S1471068425100203_ref18","doi-asserted-by":"crossref","unstructured":"Lifschitz, V. , Pearce, D. and Valverde, A. 2007. A characterization of strong equivalence for logic programs with variables. In Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201907), Baral, C. , Brewka, G. and Schlipf, J. , Eds. Vol. 4483 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 188\u2013200.","DOI":"10.1007\/978-3-540-72200-7_17"},{"key":"S1471068425100203_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-74209-5_2"},{"key":"S1471068425100203_ref13","doi-asserted-by":"crossref","unstructured":"Geatti, L. , Gianola, A. and Gigante, N. 2022. Linear temporal logic modulo theories over finite traces. In Proceedings of the Thirty-first International Joint Conference on Artificial Intelligence (IJCAI\u201922), De Raedt, L. , Ed. ijcai.org, 2641\u20132647.","DOI":"10.24963\/ijcai.2022\/366"},{"key":"S1471068425100203_ref16","unstructured":"Kamp, J. 1968. Tense Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles."},{"key":"S1471068425100203_ref6","unstructured":"Bosser, A. , Cabalar, P. , Di\u00c9guez, M. and Schaub, T. 2018. Introducing temporal stable models for linear dynamic logic. In Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR\u201918), Thielscher, M. , Toni, F. and Wolter, F. , Eds. AAAI Press, 12\u201321."},{"key":"S1471068425100203_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000409"},{"key":"S1471068425100203_ref11","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.311-347"},{"key":"S1471068425100203_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000517"},{"key":"S1471068425100203_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9028-z"},{"key":"S1471068425100203_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000639"},{"key":"S1471068425100203_ref20","unstructured":"Vilain, M. and Kautz, H. 1986. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI\u201986), Kehler, T. , Ed. Morgan Kaufmann Publishers, 377\u2013382."},{"key":"S1471068425100203_ref8","doi-asserted-by":"crossref","unstructured":"Cabalar, P. and Demri, S. 2011. Automata-based computation of temporal equilibrium models. In Proceedings of the Twenty-first International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR\u201911), Vidal, G. , Ed. Vol. 7225 of Lecture Notes in Computer Science, Springer-Verlag, 57\u201372.","DOI":"10.1007\/978-3-642-32211-2_5"},{"key":"S1471068425100203_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000557"}],"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\/S1471068425100203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T12:56:28Z","timestamp":1761310588000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068425100203\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S1471068425100203"],"URL":"https:\/\/doi.org\/10.1017\/s1471068425100203","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2025,7]]},"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"}]}}