Domain-dependent knowledge in answer set planning

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

Research output: Contribution to journalArticlepeer-review

48 Scopus citations


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
Issue number4
StatePublished - 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Logic
  • Computational Mathematics


Dive into the research topics of 'Domain-dependent knowledge in answer set planning'. Together they form a unique fingerprint.

Cite this