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 domain-independent logic programming rules for checking constraint satisfaction. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Son, T. C., Baral, C., & McIlraith, S. (2001). Planning with different forms of domain-dependent control knowledge - An answer set programming approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2173 LNAI, pp. 226–239). https://doi.org/10.1007/3-540-45402-0_17
Mendeley helps you to discover research relevant for your work.