Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Monotone Temporal Planning: Tractability, Extensions and Applications
Authors: M. Cooper, F. Maris, P. Régnier
JAIR 2014 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We also give previously unpublished results of experimental trials on benchmark problems. But first, we review previous work in the identification of tractable classes of classical planning problems. ... Section 8 describes experimental trials to validate and identify the limits of this temporal relaxation. |
| Researcher Affiliation | Academia | Martin C. Cooper EMAIL Frédéric Maris EMAIL Pierre Régnier EMAIL IRIT, Paul Sabatier University 118 Route de Narbonne 31062 Toulouse, France |
| Pseudocode | No | The paper defines concepts, theorems, and lemmas, and provides examples of actions and planning problems. However, it does not include any explicit pseudocode blocks or algorithms with structured steps. |
| Open Source Code | No | The paper mentions that further research is required "to develop tools to help users find a model of a problem involving only monotone* fluents when such a model exists." However, it does not provide any statement or link for the open-sourcing of the code used for the experimental trials or the methodology described in the paper. |
| Open Datasets | Yes | We conducted experiments on the benchmark problems from the temporal deterministic track of the 7th international planning competition IPC-2011, in order to test the applicability of our proposed temporal relaxation TR as well as the relative utility of our various lemmas for the detection of monotonicity*. |
| Dataset Splits | No | The paper states: "For each problem in each domain, let SGp denote the set of possible sub-goals in the original unrelaxed problem. For each of the 20 problems in each of these domains..." While it specifies the number of problems analyzed, it does not provide any details regarding training, validation, or test splits for these problems. |
| Hardware Specification | No | The paper describes experimental trials in Section 8 but does not provide any specific hardware details such as CPU models, GPU types, memory, or computing environment specifications used for running the experiments. |
| Software Dependencies | No | The paper mentions PDDL 2.1 as a temporal framework and Simple Temporal Problem (STP) as a solvable problem instance. It also refers to the IPC-2011 benchmarks. However, it does not list any specific software dependencies or libraries with version numbers (e.g., Python 3.x, specific solvers like CPLEX 12.x, or planning tools with versions) used for their implementation or experiments. |
| Experiment Setup | No | The paper describes the results of experimental trials in Section 8, including percentages of fluents detected as monotone* by different lemmas. However, it does not provide specific experimental setup details such as hyperparameters, training configurations, or system-level settings used during these trials. |