{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:33:57Z","timestamp":1725831237008},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_2","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T03:00:40Z","timestamp":1443495640000},"page":"19-31","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of Interval Relaxed Numeric Planning"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Aldinger","sequence":"first","affiliation":[]},{"given":"Robert","family":"Mattm\u00fcller","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"G\u00f6belbecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Aldinger, J., Mattm\u00fcller, R., G\u00f6belbecker, M.: Complexity issues of interval relaxed numeric planning. In: Proceedings of the ICAPS-15 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2015), pp. 4\u201312 (2015)","key":"2_CR1","DOI":"10.1007\/978-3-319-24489-1_2"},{"unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS\n          \n                      \n                        \n                      \n                      $$^+$$\n                     planning. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), pp. 1430\u20131435 (1993)","key":"2_CR2"},{"unstructured":"Bofill, M., Arxer, J.E., Villaret, M.: The RANTANPLAN planner: system description. In: Proceedings of the ICAPS-15 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAPS 2015), pp. 1\u201310 (2015)","key":"2_CR3"},{"key":"2_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 69, 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"unstructured":"Coles, A., Fox, M., Long, D., Smith, A.: A hybrid relaxed planning graph-LP heuristic for numeric planning domains. In: Proceedings of the 20th International Conference on Automated Planning and Search (ICAPS 2008), pp. 52\u201359 (2008)","key":"2_CR5"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1 : An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research (JAIR) 20, 61\u2013124 (2003)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"unstructured":"Helmert, M.: Decidability and undecidability results for planning with numerical state variables. In: Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 303\u2013312 (2002)","key":"2_CR7"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","volume":"20","author":"J Hoffmann","year":"2003","unstructured":"Hoffmann, J.: The Metric-FF Planning System: Translating \u2018Ignoring Delete Lists\u2019 to Numeric State Variables. Journal of Artificial Intelligence Research (JAIR) 20, 291\u2013341 (2003)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. Society for Industrial and Applied Mathematics (2009)","key":"2_CR9","DOI":"10.1137\/1.9780898717716"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01457934","volume":"104","author":"RC Young","year":"1931","unstructured":"Young, R.C.: The Algebra of Many-valued Quantities. Mathematische Annalen 104, 260\u2013290 (1931)","journal-title":"Mathematische Annalen"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:20:14Z","timestamp":1559254814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}