{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:47:44Z","timestamp":1742921264989,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699361"},{"type":"electronic","value":"9783540699378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69937-8_23","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"260-271","source":"Crossref","is-referenced-by-count":1,"title":["Using \u03b1 -ctl to Specify Complex Planning Goals"],"prefix":"10.1007","author":[{"given":"Silvio","family":"do Lago Pereira","sequence":"first","affiliation":[]},{"given":"Leliane Nunes","family":"de Barros","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","first-page":"1215","volume-title":"AAAI 1996","author":"F. Bacchus","year":"1996","unstructured":"Bacchus, F., Kabanza, F.: Planning for temporally extended goals. In: AAAI 1996, pp. 1215\u20131222. AAAI Press, Menlo Park (1996)"},{"key":"23_CR2","unstructured":"Baral, C., Zhao, J.: Goal specification in presence of non-deterministic actions. In: M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 273\u2013277 (2004)"},{"key":"23_CR3","unstructured":"Baral, C., Zhao, J.: Goal specification, non-determinism and quantifying over policies. In: AAAI (2006)"},{"issue":"1-2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence\u00a069(1-2), 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-63912-8_81","volume-title":"Recent Advances in AI Planning","author":"A. Cimatti","year":"1997","unstructured":"Cimatti, A., Giunchiglia, F., Giunchiglia, E., Traverso, P.: Planning via model checking: A decision procedure for AR. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 130\u2013142. Springer, Heidelberg (1997)"},{"key":"23_CR6","unstructured":"Cimatti, A., Roveri, M., Traverso, P.: Strong planning in non-deterministic domains via model checking. In: AIPS, pp. 36\u201343 (1998)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logic of Programs, Workshop","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Logic of Programs, Workshop, pp. 52\u201371. Springer, London (1982)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/10720246_3","volume-title":"Recent Advances in AI Planning","author":"M. Daniele","year":"2000","unstructured":"Daniele, M., Traverso, P., Vardi, M.Y.: Strong cyclic planning revisited. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol.\u00a01809, pp. 35\u201348. Springer, Heidelberg (2000)"},{"key":"23_CR9","volume-title":"Automated Planning: Theory and Practice","author":"M. Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers, San Francisco (2004)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10720246_1","volume-title":"Recent Advances in AI Planning","author":"F. Giunchiglia","year":"2000","unstructured":"Giunchiglia, F., Traverso, P.: Planning as model checking. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol.\u00a01809, pp. 1\u201320. Springer, Heidelberg (2000)"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0004-3702(97)00031-3","volume":"95","author":"F. Kabanza","year":"1997","unstructured":"Kabanza, F., Barbeau, M., St.-Denis, R.: Planning control rules for reactive agents. Artificial Intelligence\u00a095(1), 11\u201367 (1997)","journal-title":"Artificial Intelligence"},{"key":"23_CR12","first-page":"447","volume-title":"Eighteenth national conference on Artificial intelligence","author":"U. Dal Lago","year":"2002","unstructured":"Dal Lago, U., Pistore, M., Traverso, P.: Planning with a language for extended goals. In: Eighteenth national conference on Artificial intelligence, pp. 447\u2013454. AAAI, Menlo Park (2002)"},{"key":"23_CR13","first-page":"407","volume-title":"Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes","author":"R. De Nicola","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes, pp. 407\u2013419. Springer, New York (1990)"},{"key":"23_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-74128-2_8","volume-title":"Model Checking and Artificial Intelligence","author":"C. Pecheur","year":"2007","unstructured":"Pecheur, C., Raimondi, F.: Symbolic Model Checking of Logics with Actions. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt IV. LNCS (LNAI), vol.\u00a04428, pp. 113\u2013128. Springer, Heidelberg (2007)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10458-008-9034-0","volume":"9034","author":"S.L. Pereira","year":"2008","unstructured":"Pereira, S.L., Barros, L.N.: A logic-based agent that plans for extended reachability goals. Autonomous Agents and Multi-Agent Systems\u00a09034, 327\u2013344 (2008)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"23_CR16","unstructured":"Pistore, M., Bettin, R., Traverso, P.: Symbolic techniques for planning with extended goals in non-deterministic domains (2001)"},{"key":"23_CR17","unstructured":"Pistore, M., Traverso, P.: Planning as model checking for extended goals in non-deterministic domains. In: IJCAI, pp. 479\u2013486 (2001)"},{"issue":"2","key":"23_CR18","first-page":"75","volume":"25","author":"S. Thi\u00e9baux","year":"2006","unstructured":"Thi\u00e9baux, S., Gretton, C., Slaney, J., Price, D., Kabanza, F.: Decision-theoretic planning with non-markovian rewards. JAIR\u00a025(2), 75\u2013118 (2006)","journal-title":"JAIR"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69937-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:51:29Z","timestamp":1715237489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69937-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699361","9783540699378"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69937-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}