@conference {18877,
	title = {Learning to do HTN planning},
	year = {2006},
	month = {2006///},
	pages = {390 - 393},
	abstract = {We describe HDL, an algorithm that learns HTN do- main descriptions by examining plan traces produced by an expert problem-solver. Prior work on learning HTN methods requires that all the methods{\textquoteright} informa- tion except for their preconditions be given in advance so that the learner can learn the preconditions. In con- trast, HDL has no prior information about the methods. In our experiments, in most cases HDL converged fully with no more than about 200 plan traces. Furthermore, even when HDL was given only half the plan traces it required to fully converge, it usually was able to pro- duce HTN methods that were sufficient to solve more than 3/4 of the planning problems in the test set.},
	url = {https://www.aaai.org/Papers/ICAPS/2006/ICAPS06-048.pdf},
	author = {Ilghami,O. and Nau, Dana S. and Munoz-Avila,H.}
}
