Domain-Dependent Knowledge in Answer Set Planning

Details Domain-Dependent Knowledge in Answer Set Planning Domain-Dependent Knowledge in Answer Set Planning

2002-07-08

arxiv.org/abs/cs/0207023v2

Computer Science

Artificial Intelligence

70 pages, accepted for publication, TOCL Version with all proofs

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Domain-Dependent Knowledge in Answer Set Planning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domain-Dependent Knowledge in Answer Set Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain-Dependent Knowledge in Answer Set Planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172470