HTTP/2 200 date: Wed, 04 Feb 2026 21:05:24 GMT content-type: application/json content-length: 4177 access-control-expose-headers: Link access-control-allow-headers: X-Requested-With, Accept, Accept-Encoding, Accept-Charset, Accept-Language, Accept-Ranges, Cache-Control access-control-allow-origin: * vary: Accept-Encoding content-encoding: gzip server: Jetty(9.4.40.v20210413) x-rate-limit: 5 x-rate-limit-interval: 1s x-concurrency-limit: 1 x-api-pool: public permissions-policy: interest-cohort=() {"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:20:49Z","timestamp":1742988049008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031806063"},{"type":"electronic","value":"9783031806070"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-80607-0_12","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T16:35:00Z","timestamp":1735662900000},"page":"147-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regular Clocks for\u00a0Temporal Task Specifications in\u00a0Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9680-7658","authenticated-orcid":false,"given":"Giuseppe","family":"De Giacomo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9566-3576","authenticated-orcid":false,"given":"Marco","family":"Favorito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9116-251X","authenticated-orcid":false,"given":"Fabio","family":"Patrizi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"12_CR1","unstructured":"Bacchus, F., Boutilier, C., Grove, A.J.: Rewarding behaviors. In: AAAI\/IAAI, vol. 2, pp. 1160\u20131167. AAAI Press \/ The MIT Press (1996)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Brafman, R.I., De Giacomo, G., Patrizi, F.: LTLf\/LDLf non-Markovian rewards. In: AAAI, pp. 1771\u20131778. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11572"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Favorito, M., Iocchi, L., Patrizi, F.: Imitation learning over heterogeneous agents with restraining bolts. In: ICAPS, pp. 517\u2013521. AAAI Press (2020)","DOI":"10.1609\/icaps.v30i1.6747"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Favorito, M., Iocchi, L., Patrizi, F., Ronca, A.: Temporal logic monitoring rewards via transducers. In: KR, pp. 860\u2013870 (2020)","DOI":"10.24963\/kr.2020\/89"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Iocchi, L., Favorito, M., Patrizi, F.: Foundations for restraining bolts: reinforcement learning with LTLf\/LDLf restraining specifications. In: ICAPS, pp. 128\u2013136. AAAI Press (2019)","DOI":"10.1609\/icaps.v29i1.3549"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Iocchi, L., Favorito, M., Patrizi, F.: Restraining bolts for reinforcement learning agents. In: AAAI, pp. 13659\u201313662. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i09.7114"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Stasio, A.D., Fuggitti, F., Rubin, S.: Pure-past linear temporal and dynamic logic on finite traces. In: IJCAI, pp. 4959\u20134965. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/690"},{"key":"12_CR8","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI, pp. 854\u2013860. IJCAI\/AAAI (2013)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/3-540-45061-0_67","volume-title":"Automata, Languages and Programming","author":"C Eisner","year":"2003","unstructured":"Eisner, C., Fisman, D., Havlicek, J., McIsaac, A., Van Campenhout, D.: The definition of a temporal clock operator. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 857\u2013870. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_67"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-94-017-0456-4_2","volume-title":"Handbook of Philosophical Logic","author":"D Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 4, pp. 497\u2013604. Springer, Dordrecht (1984). https:\/\/doi.org\/10.1007\/978-94-017-0456-4_2"},{"key":"12_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-031-21222-2_11","volume-title":"NSV\/FoMLAS@CAV","author":"G Hariharan","year":"2022","unstructured":"Hariharan, G., Kempa, B., Wongpiromsarn, T., Jones, P.H., Rozier, K.Y.: MLTL multi-type (MLTLM): a logic for reasoning about signals of different types. In: Isac, O., Ivanov, R., Katz, G., Narodytska, N., Nenzi, L. (eds.) NSV\/FoMLAS@CAV. LNCS, vol. 13466, pp. 187\u2013204. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21222-2_11"},{"key":"12_CR13","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London (1979)"},{"key":"12_CR14","unstructured":"Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: Using reward machines for high-level task specification and decomposition in reinforcement learning. In: ICML. Proceedings of Machine Learning Research, vol.\u00a080, pp. 2112\u20132121. PMLR (2018)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1613\/JAIR.1.12440","volume":"73","author":"RT Icarte","year":"2022","unstructured":"Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: Reward machines: exploiting reward function structure in reinforcement learning. J. Artif. Intell. Res. 73, 173\u2013208 (2022). https:\/\/doi.org\/10.1613\/JAIR.1.12440","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Li, X., Vasile, C.I., Belta, C.: Reinforcement learning with temporal logic rewards. In: IROS, pp. 3834\u20133839. IEEE (2017)","DOI":"10.1109\/IROS.2017.8206234"},{"key":"12_CR17","volume-title":"An Introduction to Formal Languages and Automata","author":"P Linz","year":"2022","unstructured":"Linz, P., Rodger, S.H.: An Introduction to Formal Languages and Automata. Jones & Bartlett Learning, Boston (2022)"},{"key":"12_CR18","unstructured":"Littman, M.L., Topcu, U., Fu, J., Jr., C.L.I., Wen, M., MacGlashan, J.: Environment-independent task specifications via GLTL. CoRR abs\/1704.04341 (2017)"},{"key":"12_CR19","unstructured":"McNaughton, R., Papert, S.A.: Counter-Free Automata (MIT Research Monograph No. 65). The MIT Press, Cambridge (1971)"},{"issue":"5","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies.(AM-34), Volume 34, pp. 129\u2013154. Princeton University Press (2016)","DOI":"10.1515\/9781400882618-006"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley (1994)","DOI":"10.1002\/9780470316887"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"12_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192","volume-title":"Reinforcement learning - an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning - an introduction. MIT Press, Adaptive computation and machine learning (1998)"},{"key":"12_CR27","unstructured":"Vardi, M.Y.: The rise and fall of linear time logic. In: GandALF (2011). http:\/\/www.cs.rice.edu\/~vardi\/papers\/gandalf11-myv.pdf"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Xu, Z., Topcu, U.: Transfer of temporal logic formulas in reinforcement learning. In: IJCAI, pp. 4010\u20134018. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/557"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2024 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80607-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T17:04:01Z","timestamp":1735664641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80607-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031806063","9783031806070"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80607-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}