TY - CHAP T1 - On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework T2 - Advances in Case-Based Reasoning Y1 - 2002 A1 - Au,Tsz-Chiu A1 - Muñoz-Avila,Héctor A1 - Nau, Dana S. ED - Craw,Susan ED - Preece,Alun KW - Computer science AB - In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a planning system. JA - Advances in Case-Based Reasoning T3 - Lecture Notes in Computer Science PB - Springer Berlin / Heidelberg VL - 2416 SN - 978-3-540-44109-0 UR - http://www.springerlink.com/content/db2mr13j90mfrcaw/abstract/ ER -