{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:14:40Z","timestamp":1748578480253,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319229683"},{"type":"electronic","value":"9783319229690"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22969-0_22","type":"book-chapter","created":{"date-parts":[[2015,8,20]],"date-time":"2015-08-20T08:51:42Z","timestamp":1440060702000},"page":"310-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating None-Plans in Order to Find Plans"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Knapik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Niewiadomski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Penczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,21]]},"reference":[{"key":"22_CR1","unstructured":"Cook, D.R.: The SMT-LIBv2 language and tools: a tutorial (2012). http:\/\/www.grammatech.com\/resource\/smt\/SMTLIBTutorial.pdf"},{"issue":"1","key":"22_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-2011-578","volume":"112","author":"D Doliwa","year":"2011","unstructured":"Doliwa, D., et al.: PlanICS - a web service compositon toolset. Fundamenta Informaticae 112(1), 47\u201371 (2011)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2008.10.012","volume":"173","author":"AE Gerevini","year":"2009","unstructured":"Gerevini, A.E., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intel. 173(5), 619\u2013668 (2009)","journal-title":"Artif. Intel."},{"key":"22_CR4","unstructured":"Goldman, R.P., Musliner, D.J., Krebsbach, K.D., Boddy, M.S.: Dynamic abstraction planning. In: AAAI\/IAAI, pp. 680\u2013686 (1997)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.robot.2012.10.009","volume":"61","author":"JV G\u00f3mez","year":"2013","unstructured":"G\u00f3mez, J.V., Lumbier, A., Garrido, S., Moreno, L.: Planning robot formations with fast marching square including uncertainty conditions. Robot. Auton. Syst. 61(2), 137\u2013152 (2013)","journal-title":"Robot. Auton. Syst."},{"key":"22_CR6","unstructured":"Knapik, M.: SpaceCut - a tool for none-plan generation (2015). https:\/\/github.com\/MichalKnapik\/SpaceCut"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-29072-5_6","volume-title":"Transactions on Petri Nets and Other Models of Concurrency V","author":"M Knapik","year":"2012","unstructured":"Knapik, M., Penczek, W.: Bounded model checking for parametric timed automata. In: Jensen, K., Donatelli, S., Kleijn, J. (eds.) Transactions on Petri Nets and Other Models of Concurrency V. LNCS, vol. 6900, pp. 141\u2013159. Springer, Heidelberg (2012)"},{"key":"22_CR8","unstructured":"Knapik, M., Penczek, W.: SMT-based parameter synthesis for L\/U automata. In: Proceedings of International Workshop on Petri Nets and Software Engineering (PNSE 2012), pp. 77\u201392 (2012)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Li, Z., O\u2019Brien, L., Keung, J., Xu, X.: Effort-oriented classification matrix of web service composition. In Proceedings of the Fifth International Conference on Internet and Web Applications and Services, pp. 357\u2013362 (2010)","DOI":"10.1109\/ICIW.2010.59"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Niewiadomski, A., Penczek, W.: Towards SMT-based abstract planning in PlanICS ontology. In: Proceedings of International Conference on Knowledge Engineering and Ontology Development (KEOD), pp. 123\u2013131 (2013)","DOI":"10.5220\/0004514901230131"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Niewiadomski, A., Penczek, W.: SMT-based abstract temporal planning. In: Proceedings of International Workshop on Petri Nets and Software Engineering, pp. 55\u201374 (2014)","DOI":"10.1007\/978-3-662-48650-4_4"},{"key":"22_CR12","unstructured":"Nourbakhsh, I.: Using abstraction to interleave planning and execution. In: Proceedings of the Third Biannual World Automation Congress, vol. 2 (1998)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-30581-1_5","volume-title":"Semantic Web Services and Web Process Composition","author":"J Rao","year":"2005","unstructured":"Rao, J., Su, X.: A survey of automated web service composition methods. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43\u201354. Springer, Heidelberg (2005)"},{"key":"22_CR14","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2009","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall Press, Upper Saddle River (2009)","edition":"3"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-55224-3_37","volume-title":"Parallel Processing and Applied Mathematics","author":"J Skaruz","year":"2014","unstructured":"Skaruz, J., Niewiadomski, A., Penczek, W.: Evolutionary algorithms for abstract planning. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015bniewski, J. (eds.) PPAM 2013, Part I. LNCS, vol. 8384, pp. 392\u2013401. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22969-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T02:54:18Z","timestamp":1748573658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22969-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319229683","9783319229690"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22969-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"21 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}