ML Anthology

In Defense of PDDL Axioms

Sylvie Thiébaux, Jörg Hoffmann, Bernhard Nebel
IJCAI 2003 pp. 961-968
doi:10.1016/j.artint.2005.05.004 /ijcai/2003/thiebaux2003ijcai-defense/

Abstract

There is controversy as to whether explicit support for pddl-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers have deplored the lack of precise semantics for such axioms, while others have argued that it might be best to compile them away. We propose an adequate semantics for pddl axioms and show that they are an essential feature by proving that it is impossible to compile them away if we restrict the growth of plans and domain descriptions to be polynomial. These results suggest that adding a reasonable implementation to handle axioms inside the planner is beneficial for the performance. Our experiments confirm this suggestion.

PDF Semantic Scholar

Cite

Text

Thiébaux et al. "In Defense of PDDL Axioms." International Joint Conference on Artificial Intelligence, 2003. doi:10.1016/j.artint.2005.05.004

Markdown

[Thiébaux et al. "In Defense of PDDL Axioms." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/thiebaux2003ijcai-defense/) doi:10.1016/j.artint.2005.05.004

BibTeX

@inproceedings{thiebaux2003ijcai-defense,
  title     = {{In Defense of PDDL Axioms}},
  author    = {Thiébaux, Sylvie and Hoffmann, Jörg and Nebel, Bernhard},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {961-968},
  doi       = {10.1016/j.artint.2005.05.004},
  url       = {https://mlanthology.org/ijcai/2003/thiebaux2003ijcai-defense/}
}