{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:04:07Z","timestamp":1746417847229,"version":"3.40.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_3","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"33-47","source":"Crossref","is-referenced-by-count":5,"title":["Non-classical Planning with a Classical Planner: The Power of Transformations"],"prefix":"10.1007","author":[{"given":"Hector","family":"Geffner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Erol, K., Hendler, J., Nau, D.S.: HTN planning: Complexity and expressivity. In: Proc. 12th Nat. Conf. on Artificial Intelligence, pp. 1123\u20131123 (1994)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"H. Levesque","year":"1997","unstructured":"Levesque, H., Reiter, R., Lesp\u00e9rance, Y., Lin, F., Scherl, R.: GOLOG: A logic programming language for dynamic domains. J. of Logic Progr.\u00a031, 59\u201383 (1997)","journal-title":"J. of Logic Progr."},{"key":"3_CR3","unstructured":"Sutton, R., Barto, A.: Introduction to Reinforcement Learning. MIT Press (1998)"},{"key":"3_CR4","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice-Hall (2009)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and practice. Morgan Kaufmann (2004)","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S. Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research\u00a039, 127\u2013177 (2010)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0004-3702(99)00010-7","volume":"109","author":"D.V. McDermott","year":"1999","unstructured":"McDermott, D.V.: Using regression-match graphs to control search in planning. Artificial Intelligence\u00a0109(1-2), 111\u2013159 (1999)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B. Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence\u00a0129(1-2), 5\u201333 (2001)","journal-title":"Artificial Intelligence"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1613\/jair.1492","volume":"22","author":"J. Hoffmann","year":"2004","unstructured":"Hoffmann, J., Porteous, J., Sebastia, L.: Ordered landmarks in planning. Journal of Artificial Intelligence Research\u00a022, 215\u2013278 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research\u00a026, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR12","unstructured":"Kautz, H.A., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proc. AAAI, pp. 1194\u20131201 (1996)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2012.08.001","volume":"193","author":"J. Rintanen","year":"2012","unstructured":"Rintanen, J.: Planning as satisfiability: Heuristics. Art. Int.\u00a0193, 45\u201386 (2012)","journal-title":"Art. Int."},{"key":"3_CR14","unstructured":"Yoon, S., Fern, A., Givan, R.: FF-replan: A baseline for probabilistic planning. In: Proc. 17th Int. Conf. on Automated Planning and Scheduling, pp. 352\u2013359 (2007)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Geffner, H., Bonet, B.: A Concise Introduction to Models and Methods in Automated Planning. Morgan & Claypool (2013)","DOI":"10.1007\/978-3-031-01564-9"},{"key":"3_CR16","unstructured":"Cresswell, S., Coddington, A.M.: Compilation of LTL goal formulas into PDDL. In: Proc. 16th European Conf. on Artificial Intelligence, pp. 985\u2013986 (2004)"},{"key":"3_CR17","unstructured":"Edelkamp, S.: On the compilation of plan constraints and preferences. In: Proc. 16th Int. Conf. on Automated Planning and Scheduling, pp. 374\u2013377 (2006)"},{"key":"3_CR18","unstructured":"Albarghouthi, A., Baier, J.A., McIlraith, S.A.: On the use of planning technology for verification. In: Proc. ICAPS 2009 Workshop VV&PS (2009)"},{"key":"3_CR19","unstructured":"Patrizi, F., Lipovetzky, N., de Giacomo, G., Geffner, H.: Computing infinite plans for LTL goals using a classical planner. In: Proc. 22nd Int. Joint Conf. on Artificial Intelligence, pp. 2003\u20132008 (2011)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Taig, R., Brafman, R.: Compiling conformant probabilistic planning problems into classical planning. In: Proc. ICAPS (2013)","DOI":"10.1609\/icaps.v23i1.13540"},{"key":"3_CR21","unstructured":"Brafman, R., Shani, G.: A multi-path compilation approach to contingent planning. In: Proc. AAAI (2012)"},{"key":"3_CR22","unstructured":"Palacios, H., Albore, A., Geffner, H.: Compiling contingent planning into classical planning: New translations and results. In: Proc. ICAPS Workshop on Models and Paradigms for Planning under Uncertainty (2014)"},{"key":"3_CR23","unstructured":"Smith, D.E.: Choosing objectives in over-subscription planning. In: Proc. 14th Int. Conf. on Automated Planning and Scheduling, pp. 393\u2013401 (2004)"},{"key":"3_CR24","unstructured":"Helmert, M., Do, M.B., Refanidis, I.: 2008 IPC Deterministic planning competition. In: 6th IPC Booklet, ICAPS 2008 (2008)"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1613\/jair.2857","volume":"36","author":"E. Keyder","year":"2009","unstructured":"Keyder, E., Geffner, H.: Soft goals can be compiled away. Journal of Artificial Intelligence Research\u00a036, 547\u2013556 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez, M., Geffner, H.: Probabilistic plan recognition using off-the-shelf classical planners. In: Proc. 24th Conf. on Artificial Intelligence, pp. 1121\u20131126 (2010)","DOI":"10.1609\/aaai.v24i1.7745"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Flexible and scalable partially observable planning with linear translations. In: Proc. AAAI (2014)","DOI":"10.1609\/aaai.v28i1.9047"},{"key":"3_CR28","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1613\/jair.2708","volume":"35","author":"H. Palacios","year":"2009","unstructured":"Palacios, H., Geffner, H.: Compiling uncertainty away in conformant planning problems with bounded width. JAIR\u00a035, 623\u2013675 (2009)","journal-title":"JAIR"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Width and complexity of belief tracking in non-deterministic conformant and contingent planning. In: Proc. 26nd Conf. on Artificial Intelligence, pp. 1756\u20131762 (2012)","DOI":"10.1609\/aaai.v26i1.8365"},{"key":"3_CR30","unstructured":"Albore, A., Palacios, H., Geffner, H.: A translation-based approach to contingent planning. In: Proc. 21st Int. Joint Conf. on Artificial Intelligence, pp. 1623\u20131628 (2009)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Maliah, S., Brafman, R., Karpas, E., Shani, G.: Partially observable online contingent planning using landmark heuristics. In: Proc. ICAPS (2014)","DOI":"10.1609\/icaps.v24i1.13632"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Bonet, B., Palacios, H., Geffner, H.: Automatic derivation of memoryless policies and finite-state controllers using classical planners. In: Proc. ICAPS (2009)","DOI":"10.1609\/icaps.v19i1.13379"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press (1995)","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer (2007)","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"3_CR35","unstructured":"van Ditmarsch, H., Kooi, B.: Semantic results for ontic and epistemic change. In: Logic and the Foundations of Game and Decision Theory (LOFT 7), pp. 87\u2013117 (2008)"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Kominis, F., Geffner, H.: Beliefs in multiagent planning: From one agent to many. In: Proc. ICAPS Workshop on Distributed and Multi-Agent Planning (2014)","DOI":"10.1609\/icaps.v25i1.13726"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Brafman, R., Shani, G., Zilberstein, S.: Qualitative planning under partial observability in multi-agent domains. In: Proc. AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8643"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:54:52Z","timestamp":1746377692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}