@conference {18911,
	title = {Learning approximate preconditions for methods in hierarchical plans},
	series = {ICML {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {337 - 344},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquiring this knowledge is to learn it from plan traces, but this method typically requires a huge number of plan traces to converge. In this paper, we show that the problem with slow convergence can be circumvented by having the learner generate solution plans even before the planning domain is completely learned. Our empirical results show that these improvements reduce the size of the training set that is needed to find correct answers to a large percentage of planning problems in the test set.},
	isbn = {1-59593-180-5},
	doi = {10.1145/1102351.1102394},
	url = {http://doi.acm.org/10.1145/1102351.1102394},
	author = {Ilghami,Okhtay and Mu{\~n}oz-Avila,H{\'e}ctor and Nau, Dana S. and Aha,David W.}
}
