Reference: Son, T. C.; Baral, C.; & McIlraith, S. Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach. Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), Vienna, Austria, September 17-19, 2001, 2001.
Abstract: In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning with temporal knowledge into ASP. To do so, we view domain-dependent control knowledge as sets of independent constraints. An advantage of this approach is that domain-dependent control knowledge can be modularly formalized and added to the planning problem as desired. We define a set of constructs for constraint representation and provide a set of domainindependent logic programming rules for checking constraint satisfaction.
Full paper available as pdf.