| Abstract
|
In this paper we present a declarative app … In this paper we present a declarative approach to addingdomain-dependent control knowledge for Answer Set Planning (ASP).Our approach allows different types of domain-dependent control knowledgesuch as hierarchical, temporal, or procedural knowledge to be representedand exploited in parallel, thus combining the ideas of controlknowledge in HTN-planning, GOLOG-programming, and planning withtemporal knowledge into ASP. To do so, we view domain-dependent controlknowledge as sets of independent constraints. An advantage of thisapproach is that domain-dependent control knowledge can be modularlyformalized and added to the planning problem as desired. We define a setof constructs for constraint representation and provide a set of domainindependentlogic programming rules for checking constraint satisfaction. ules for checking constraint satisfaction.
|
| Address
|
Vienna, Austria +
|
| Author
|
Tran Cao Son +,
Chitta Baral +,
Sheila A. McIlraith +
|
| Bibtype
|
inproceedings +
|
| Booktitle
|
Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001) +
|
| Key
|
KSL-01-18 +
|
| Modification dateThis property is a special property in this wiki.
|
1 May 2009 14:04:13 +
|
| Month
|
September +
|
| Tag
|
Computer science +
|
| Title
|
Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach +
|
| Tr id
|
KSL-01-18 +
|
| Year
|
2001 +
|
| Categories |
Proceeding Paper,
Publication,
KSL Technical Report
|
