@inbook {18914,
	title = {On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework},
	booktitle = {Advances in Case-Based Reasoning},
	series = {Lecture Notes in Computer Science},
	volume = {2416},
	year = {2002},
	month = {2002///},
	pages = {199 - 206},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {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.},
	keywords = {Computer science},
	isbn = {978-3-540-44109-0},
	url = {http://www.springerlink.com/content/db2mr13j90mfrcaw/abstract/},
	author = {Au,Tsz-Chiu and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S.},
	editor = {Craw,Susan and Preece,Alun}
}
