{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:22:11Z","timestamp":1725549731336},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290414"},{"type":"electronic","value":"9783540317333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558590_1","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T12:53:11Z","timestamp":1128516791000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Action Redundancy"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Ferrara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Liberatore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Fink, E., Yang, Q.: Formalizing plan justifications. In: Proceedings of the Ninth Conference of the Canadian Society for Computational Studies of Intelligence, pp. 9\u201314 (1992)","key":"1_CR1"},{"unstructured":"Fink, E., Yang, Q.: A spectrum of plan justifications. In: Proceedings of the AAAI 1993 Spring Symposium, pp. 29\u201333 (1993)","key":"1_CR2"},{"unstructured":"Knoblock, C., Tenenberg, J., Yang, Q.: Characterizing abstraction hierarchies for planning. In: Proc. of AAAI 1991, pp. 692\u2013697 (1991)","key":"1_CR3"},{"unstructured":"Yang, Q., Tenenberg, J.: ABTWEAK: Abstracting a nonlinear, least commitment planner. In: Proc. of AAAI 1990, pp. 204\u2013209 (1990)","key":"1_CR4"},{"unstructured":"Bacchus, F., Yang, Q.: The downward refinement property. In: Proc. of IJCAI 1991, pp. 286\u2013293 (1991)","key":"1_CR5"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-63912-8_97","volume-title":"Recent Advances in AI Planning","author":"B. Nebel","year":"1997","unstructured":"Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring irrelevant facts and operators in plan generation. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 338\u2013350. Springer, Heidelberg (1997)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence\u00a02, 189\u2013208 (1971)","journal-title":"Artificial Intelligence"},{"unstructured":"Bylander, T.: Complexity results for planning. In: Proc. of IJCAI 1991, pp. 274\u2013279 (1991)","key":"1_CR8"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0004-3702(94)90005-1","volume":"66","author":"B. Nebel","year":"1994","unstructured":"Nebel, B., B\u00e4ckstr\u00f6m, C.: On the computational complexity of temporal projection, planning, and plan validation. Artificial Intelligence\u00a066, 125\u2013160 (1994)","journal-title":"Artificial Intelligence"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","volume":"11","author":"C. B\u00e4ckstr\u00f6m","year":"1995","unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS+ planning. Computational Intelligence\u00a011, 625\u2013656 (1995)","journal-title":"Computational Intelligence"},{"unstructured":"B\u00e4ckstr\u00f6m, C.: Equivalence and tractability results for SAS+ planning. In: Proc. of KR 1992, pp. 126\u2013137 (1992)","key":"1_CR11"},{"unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: On the computational complexity of planning and story understanding. In: Proc. of ECAI 1992, pp. 349\u2013353 (1992)","key":"1_CR12"},{"unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS+ planning. In: Proc. of IJCAI 1993, pp. 1430\u20131435 (1993)","key":"1_CR13"},{"unstructured":"B\u00e4ckstr\u00f6m, C., Jonsson, P.: Planning with abstraction hierarchies can be exponentially less efficient. In: Proc. of IJCAI 1995, pp. 1599\u20131605 (1995)","key":"1_CR14"},{"unstructured":"Goldman, R., Geib, C., Miller, C.: A new model of plan recognition. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI 1999), pp. 245\u2013254 (1999)","key":"1_CR15"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0004-3702(92)90056-4","volume":"55","author":"S. Kambhampati","year":"1992","unstructured":"Kambhampati, S., Hendler, J.: A validation-structure-based theory of plan modification and reuse. Artificial Intelligence\u00a055, 193\u2013258 (1992)","journal-title":"Artificial Intelligence"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1613\/jair.79","volume":"2","author":"S. Hanks","year":"1995","unstructured":"Hanks, S., Weld, D.: A domain-independent algorithm for plan adaptation. J. of Artificial Intelligence Research\u00a02, 319\u2013360 (1995)","journal-title":"J. of Artificial Intelligence Research"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0004-3702(94)00082-C","volume":"76","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence\u00a076, 427\u2013454 (1995)","journal-title":"Artificial Intelligence"},{"unstructured":"Liberatore, P.: On non-conservative plan modification. In: Proc. of ECAI 1998, pp. 518\u2013519 (1998)","key":"1_CR19"},{"unstructured":"Kambhampati, S.: On the utility of systematicity: Understanding tradeoffs between redundancy and commitment in partial-ordering planning. In: Proc. of IJCAI 1993, pp. 1380\u20131387 (1993)","key":"1_CR20"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558590_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:47Z","timestamp":1619507387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558590_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290414","9783540317333"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11558590_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}