{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T02:43:26Z","timestamp":1790995406911,"version":"4.1.0"},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"3-4","license":[{"start":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T00:00:00Z","timestamp":1533859200000},"content-version":"unspecified","delay-in-days":40,"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":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP system<jats:italic>clingo<\/jats:italic>.<\/jats:p><jats:p><jats:italic>Under consideration for publication in Theory and Practice of Logic Programming (TPLP)<\/jats:italic><\/jats:p>","DOI":"10.1017\/s1471068418000297","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T05:44:17Z","timestamp":1533879857000},"page":"406-420","source":"Crossref","is-referenced-by-count":24,"title":["Temporal Answer Set Programming on Finite Traces"],"prefix":"10.1017","volume":"18","author":[{"given":"PEDRO","family":"CABALAR","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ROLAND","family":"KAMINSKI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ANNA","family":"SCHUHMANN","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"key":"S1471068418000297_ref15","unstructured":"Lee J. , Lifschitz V. , and Yang F. 2013. Action language BC: Preliminary report. See Rossi (2013), 983\u2013989."},{"key":"S1471068418000297_ref2","doi-asserted-by":"crossref","unstructured":"Bozzelli L. and Pearce D. 2015. On the complexity of temporal equilibrium logic. In Proceedings of the Thirtieth Annual Symposium on Logic in Computer Science (LICS'15). IEEE Computer Society Press, 645\u2013656.","DOI":"10.1109\/LICS.2015.65"},{"key":"S1471068418000297_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000307"},{"key":"S1471068418000297_ref20","volume-title":"Features and fluents: the representation of knowledge about dynamical systems","author":"Sandewall","year":"1994"},{"key":"S1471068418000297_ref11","doi-asserted-by":"crossref","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , and Schaub T. 2018. Multi-shot ASP solving with clingo. Theory and Practice of Logic Programming. To appear.","DOI":"10.1017\/S1471068418000054"},{"key":"S1471068418000297_ref18","doi-asserted-by":"crossref","unstructured":"Pnueli A. 1977. The temporal logic of programs. In Proceedings of the Eight-teenth Symposium on Foundations of Computer Science (FOCS'77). IEEE Computer Society Press, 46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"key":"S1471068418000297_ref1","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.798985"},{"key":"S1471068418000297_ref16","doi-asserted-by":"crossref","unstructured":"Lifschitz V. 1999. Answer set planning. In Proceedings of the International Conference on Logic Programming (ICLP'99), D. de Schreye , Ed. MIT Press, 23\u201337.","DOI":"10.1007\/3-540-46767-X_28"},{"key":"S1471068418000297_ref5","doi-asserted-by":"crossref","unstructured":"Cabalar P. and Di\u00e9guez M. 2011. STELP \u2014 a tool for temporal answer set programming. In Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), J. Delgrande and W. Faber , Eds. Lecture Notes in Artificial Intelligence, vol. 6645. Springer-Verlag, 370\u2013375.","DOI":"10.1007\/978-3-642-20895-9_43"},{"key":"S1471068418000297_ref17","unstructured":"Oikarinen E. and Janhunen T. 2006. Modular equivalence for normal logic programs. In Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), G. Brewka , S. Coradeschi , A. Perini , and P. Traverso , Eds. IOS Press, 412\u2013416."},{"key":"S1471068418000297_ref4","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'11), G. Vidal , Ed. Lecture Notes in Computer Science, vol. 7225. Springer-Verlag, 57\u201372.","DOI":"10.1007\/978-3-642-32211-2_5"},{"key":"S1471068418000297_ref21","first-page":"234","article-title":"On the complexity of derivation in the propositional calculus","volume":"8","author":"Tseitin","year":"1968","journal-title":"Zapiski nauchnykh seminarov LOMI"},{"key":"S1471068418000297_ref13","first-page":"193","article-title":"Action languages","volume":"3","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068418000297_ref7","unstructured":"De Giacomo G. and Vardi M. 2013. Linear temporal logic and linear dynamic logic on finite traces. See Rossi (2013), 854\u2013860."},{"key":"S1471068418000297_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_20"},{"key":"S1471068418000297_ref19","unstructured":"Rossi F. , Ed. 2013. Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI'13). IJCAI\/AAAI Press."},{"key":"S1471068418000297_ref8","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"Emerson","year":"1990"},{"key":"S1471068418000297_ref14","volume-title":"Sitzungsberichte der Preussischen Akademie der Wissenschaften","author":"Heyting","year":"1930"},{"key":"S1471068418000297_ref3","doi-asserted-by":"crossref","unstructured":"Cabalar P. 2010. A normal form for linear temporal equilibrium logic. In Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), T. Janhunen and I. Niemel\u00e4 , Eds. Lecture Notes in Artificial Intelligence, vol. 6341. Springer-Verlag, 64\u201376.","DOI":"10.1007\/978-3-642-15675-5_8"},{"key":"S1471068418000297_ref9","first-page":"51","article-title":"Consistency of Clark's completion and the existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"S1471068418000297_ref10","doi-asserted-by":"crossref","unstructured":"Gabbay D. 1987. The declarative past and imperative future: Executable temporal logic for interactive systems. In Proceedings of the Conference on Temporal Logic in Specification, B. Banieqbal , H. Barringer , and A. Pnueli , Eds. Lecture Notes in Computer Science, vol. 398. Springer-Verlag, 409\u2013448.","DOI":"10.1007\/3-540-51803-7_36"}],"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\/S1471068418000297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T23:26:53Z","timestamp":1571700413000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000297\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":21,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S1471068418000297"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000297","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}