{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:19:50Z","timestamp":1759033190186},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"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":[[2017,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this note, we consider the problem of introducing variables in temporal logic programs under the formalism of <jats:italic>Temporal Equilibrium Logic<\/jats:italic>, an extension of Answer Set Programming for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of Temporal Equilibrium Logic that shares the syntax of first-order Linear-time Temporal Logic but has different semantics, selecting some Linear-time Temporal Logic models we call <jats:italic>temporal stable models<\/jats:italic>. Then, we consider a subclass of theories (called <jats:italic>splittable temporal logic programs<\/jats:italic>) that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of <jats:italic>safe variables<\/jats:italic> that suffices to show the property of <jats:italic>domain independence<\/jats:italic> \u2013 that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard Answer Set Programming grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation.<\/jats:p>","DOI":"10.1017\/s1471068416000570","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T11:47:24Z","timestamp":1478864844000},"page":"226-243","source":"Crossref","is-referenced-by-count":3,"title":["Temporal logic programs with variables"],"prefix":"10.1017","volume":"17","author":[{"given":"FELICIDAD","family":"AGUADO","sequence":"first","affiliation":[]},{"given":"PEDRO","family":"CABALAR","sequence":"additional","affiliation":[]},{"given":"GILBERTO","family":"P\u00c9REZ","sequence":"additional","affiliation":[]},{"given":"CONCEPCI\u00d3N","family":"VIDAL","sequence":"additional","affiliation":[]},{"given":"MART\u00cdN","family":"DI\u00c9GUEZ","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"S1471068416000570_ref11","first-page":"169","volume-title":"Stable Models and an Alternative Logic Programming Paradigm","author":"Marek","year":"1999"},{"key":"S1471068416000570_ref7","unstructured":"Calimeri F. , Faber W. , Gebser M. , Ianni G. , Kaminski R. , Krennwallner T. , Leone N. , Ricca F. and Schaub T. 2015. ASP-core-2 input language format. Accessed 12 October 2016. URL: https:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.03c.pdf."},{"key":"S1471068416000570_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87803-2_8"},{"key":"S1471068416000570_ref15","first-page":"46","volume-title":"Proc. 18th Annual Symposium on Foundations of Computer Science","author":"Pnueli","year":"1977"},{"key":"S1471068416000570_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068416000570_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_39"},{"key":"S1471068416000570_ref1","first-page":"8","volume-title":"JELIA'08","author":"Aguado","year":"2008"},{"key":"S1471068416000570_ref5","first-page":"370","volume-title":"LPNMR'11","author":"Cabalar","year":"2011"},{"key":"S1471068416000570_ref2","first-page":"80","volume-title":"LPNMR'11","author":"Aguado","year":"2011"},{"key":"S1471068416000570_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068416000570_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9028-z"},{"key":"S1471068416000570_ref13","first-page":"57","volume-title":"Proc. of the 2nd International Workshop on Non-Monotonic Extensions of Logic Programming (NMELP'96)","author":"Pearce","year":"1996"},{"key":"S1471068416000570_ref9","first-page":"1070","volume-title":"Logic Programming: Proc. of the 7th International Conference and Symposium","author":"Gelfond","year":"1988"},{"key":"S1471068416000570_ref3","first-page":"645","volume-title":"Proc. of the 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, (LICS'15)","author":"Bozzelli","year":"2015"},{"key":"S1471068416000570_ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068416000570_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_8"}],"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\/S1471068416000570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T02:08:33Z","timestamp":1555553313000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000570\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["S1471068416000570"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000570","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}