Skip to Main content Skip to Navigation
Conference papers

A KC Map for Variants of Nondeterministic PDDL

Sergej Scheck 1 Alexandre Niveau 1 Bruno Zanuttini 1 
1 Equipe MAD - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : We study different languages for representing nondeterministic actions in planning from the point of view of knowledge compilation. Precisely, we consider succinctness issues (how succinct is the description of an action in each language?), and complexity issues (tractability or hardness of several queries and transformations which arise naturally in planning and belief tracking). We study an abstract, nondeterministic version of PDDL, nondeterministic conditional STRIPS, and the languages NPDDL_seq and NPDDL_not obtained by adding sequence and negation to nondeterministic PDDL. We show that these languages have different succinctness and different complexity for the most natural queries.
Document type :
Conference papers
Complete list of metadata
Contributor : Bruno Zanuttini Connect in order to contact the contributor
Submitted on : Wednesday, May 4, 2022 - 1:22:52 PM
Last modification on : Saturday, June 25, 2022 - 9:57:38 AM
Long-term archiving on: : Friday, August 5, 2022 - 6:35:31 PM


Files produced by the author(s)


  • HAL Id : hal-03658932, version 1


Sergej Scheck, Alexandre Niveau, Bruno Zanuttini. A KC Map for Variants of Nondeterministic PDDL. 16es journées d'intelligence artificielle fondamentale (JIAF 2022), Jun 2022, Saint-Étienne, France. ⟨hal-03658932⟩



Record views


Files downloads