2026-07-22T12:15:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24453 2026-01-21T10:06:27Z ddc:004 open_access

PDDL to DFA: A Symbolic Transformation for Effective Reasoning De Giacomo, Giuseppe Di Stasio, Antonio Parretti, Gianmarco Fully Observable Nondeterministic Planning Linear Temporal Logics on finite traces Reactive Synthesis DFA ltl_f reactive synthesis under environment specifications, which concerns the automated generation of strategies enforcing logical specifications, has emerged as a powerful technique for developing autonomous AI systems. It shares many similarities with Fully Observable Nondeterministic (fond) planning. In particular, nondeterministic domains can be expressed as ltl_f environment specifications. However, this is not needed since nondeterministic domains can be transformed into deterministic finite-state automata (dfa) to be used directly in the synthesis process. In this paper, we present a practical symbolic technique for translating domains expressed in Planning Domain Definition Language (pddl) into dfas. The technique allows for the integration of the planning domain, reduced to dfa in a symbolic form, into current symbolic ltl_f synthesis tools. We implemented our technique in a new tool, pddl2dfa, and applied it to solve fond planning by using state-of-the-art reactive synthesis techniques in a tool called syft4fond. Our empirical results confirm the effectiveness of our approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Giuseppe De Giacomo and Antonio Di Stasio and Gianmarco Parretti 2025 Is Part Of LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TIME.2025.7 urn:nbn:de:0030-drops-244532 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.7 eng https://creativecommons.org/licenses/by/4.0/legalcode