@inbook {18918,
	title = {Planning in Answer Set Programming Using Ordered Task Decomposition},
	booktitle = {KI 2003: Advances in Artificial Intelligence},
	series = {Lecture Notes in Computer Science},
	volume = {2821},
	year = {2003},
	month = {2003///},
	pages = {490 - 504},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In this paper we introduce a formalism for solving Hierarchical Task Network ( HTN ) Planning using Answer Set Programming ( ASP ). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP {\textquoteright}s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete : answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non- HTN planning and (2) SHOP , a dedicated planning system. We show that our approach outperforms non- HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs.},
	keywords = {Computer science},
	isbn = {978-3-540-20059-8},
	url = {http://www.springerlink.com/content/ekt1kye92lh12lpj/abstract/},
	author = {Dix,J{\"u}rgen and Kuter,Ugur and Nau, Dana S.},
	editor = {G{\"u}nter,Andreas and Kruse,Rudolf and Neumann,Bernd}
}
