DROPS

Artifact

Software

DOI: 10.4230/artifacts.24786

Syft4Fond

Authors: Gianmarco Parretti

Abstract

Cite as

Gianmarco Parretti. Syft4Fond (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-24786,
   title = {{Syft4Fond}}, 
   author = {Parretti, Gianmarco},
   note = {Software (visited on 2025-10-13)},
   url = {https://github.com/GianmarcoDIAG/syft4fond},
   doi = {10.4230/artifacts.24786},
}

Document

DOI: 10.4230/LIPIcs.TIME.2025.7

PDDL to DFA: A Symbolic Transformation for Effective Reasoning

Authors: Giuseppe De Giacomo, Antonio Di Stasio, and Gianmarco Parretti

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract

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.

Cite as

Giuseppe De Giacomo, Antonio Di Stasio, and Gianmarco Parretti. PDDL to DFA: A Symbolic Transformation for Effective Reasoning. In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{degiacomo_et_al:LIPIcs.TIME.2025.7,
  author =	{De Giacomo, Giuseppe and Di Stasio, Antonio and Parretti, Gianmarco},
  title =	{{PDDL to DFA: A Symbolic Transformation for Effective Reasoning}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{7:1--7:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.7},
  URN =		{urn:nbn:de:0030-drops-244532},
  doi =		{10.4230/LIPIcs.TIME.2025.7},
  annote =	{Keywords: Fully Observable Nondeterministic Planning, Linear Temporal Logics on finite traces, Reactive Synthesis, DFA}
}

Search Results

Documents authored by Parretti, Gianmarco

Syft4Fond

Abstract

Cite as

PDDL to DFA: A Symbolic Transformation for Effective Reasoning

Abstract

Cite as

Thanks for your feedback!

Could not send message