Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach

Tran Cao Son, Chitta Baral, Sheila A. McIlraith

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.
BibTeX
@inproceedings{son2001planning,
  author = {Tran Cao Son and Chitta Baral and Sheila A. McIlraith},
  title = {{Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach}},
  booktitle = {LPNMR},
  year = {2001},
  doi = {10.1007/3-540-45402-0\_17},
}

Loading related content...

Figure