Domain-Dependent Knowledge in Answer Set Planning release_qervn3f53vfpjcz7oiz34ptpxi

by Tran Cao Son, Chitta Baral, Nam Tran, Sheila McIlraith

Released as a article .

2005  

Abstract

In this paper we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. We show how temporal, procedural and HTN-based control knowledge can be incorporated into AnsProlog* by the modular addition of a small number of domain-dependent rules, without the need to modify the planner. We formally prove the correctness of our planner, both in the absence and presence of the control knowledge. Finally, we perform some initial experimentation that demonstrates the potential reduction in planning time that can be achieved when procedural domain knowledge is used to solve planning problems with large plan length.
In text/plain format

Archived Files and Locations

application/pdf  668.0 kB
file_jz7zhgxmbngyvn3bmzcpv4mrmu
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2005-08-29
Version   v2
Language   en ?
arXiv  cs/0207023v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5b20af6c-49b4-4a1f-8598-1748688670c9
API URL: JSON