In defense of PDDL axioms

Sylvie Thiebaux, Jorg Hoffmann, Bernhard Nebel

    Research output: Contribution to journalConference articlepeer-review

    26 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)961-966
    Number of pages6
    JournalIJCAI International Joint Conference on Artificial Intelligence
    Publication statusPublished - 2003
    Event18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, Mexico
    Duration: 9 Aug 200315 Aug 2003

    Fingerprint

    Dive into the research topics of 'In defense of PDDL axioms'. Together they form a unique fingerprint.

    Cite this