Domain-dependent knowledge in answer set planning
ACM Transactions on Computational Logic · 2006-10 · 7 (4) · 613-657
DOI: 10.1145/1183278.1183279 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2006-10. Verfasst von Tran Cao Son und 3 weiteren Autor:innen. Die Arbeit wurde bisher 33-mal zitiert (Crossref) und nennt 54 Literaturangaben.
Abstract (Originalsprache)
In this article 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.
Zitieren
APA
Son, T. C., Baral, C., Tran, N., & Mcilraith, S. (2006). Domain-dependent knowledge in answer set planning. ACM Transactions on Computational Logic, 7(4), 613-657. https://doi.org/10.1145/1183278.1183279
Vancouver
Son TC, Baral C, Tran N, Mcilraith S. Domain-dependent knowledge in answer set planning. ACM Transactions on Computational Logic. 2006;7(4):613-657. doi:10.1145/1183278.1183279
BibTeX
@article{Son2006,
author = {Son, Tran Cao and Baral, Chitta and Tran, Nam and Mcilraith, Sheila},
title = {Domain-dependent knowledge in answer set planning},
journal = {ACM Transactions on Computational Logic},
year = {2006},
volume = {7},
number = {4},
pages = {613--657},
doi = {10.1145/1183278.1183279}
}
EUVIMED