Domain-dependent knowledge in answer set planning

Tran Cao Son, Chitta Baral, Nam Tran, Sheila Mcilraith

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)613-657
Number of pages45
JournalACM Transactions on Computational Logic
Volume7
Issue number4
DOIs
StatePublished - 2006

Fingerprint

Answer Sets
Planning
Dependent
Logic programming
Domain Knowledge
Logic Programming
Experimentation
Correctness
Semantics
Knowledge
Demonstrate

ASJC Scopus subject areas

  • Computational Mathematics
  • Logic

Cite this

Domain-dependent knowledge in answer set planning. / Son, Tran Cao; Baral, Chitta; Tran, Nam; Mcilraith, Sheila.

In: ACM Transactions on Computational Logic, Vol. 7, No. 4, 2006, p. 613-657.

Research output: Contribution to journalArticle

Son, Tran Cao ; Baral, Chitta ; Tran, Nam ; Mcilraith, Sheila. / Domain-dependent knowledge in answer set planning. In: ACM Transactions on Computational Logic. 2006 ; Vol. 7, No. 4. pp. 613-657.
@article{c172857d028541a1acfddb982f226af1,
title = "Domain-dependent knowledge in answer set planning",
abstract = "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.",
author = "Son, {Tran Cao} and Chitta Baral and Nam Tran and Sheila Mcilraith",
year = "2006",
doi = "10.1145/1166109.1166110",
language = "English (US)",
volume = "7",
pages = "613--657",
journal = "ACM Transactions on Computational Logic",
issn = "1529-3785",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Domain-dependent knowledge in answer set planning

AU - Son, Tran Cao

AU - Baral, Chitta

AU - Tran, Nam

AU - Mcilraith, Sheila

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750197653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750197653&partnerID=8YFLogxK

U2 - 10.1145/1166109.1166110

DO - 10.1145/1166109.1166110

M3 - Article

VL - 7

SP - 613

EP - 657

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

SN - 1529-3785

IS - 4

ER -