Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals
Authors: Jorge Torres, Jorge A. Baier
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We evaluate our compilation empirically, comparing it against Baier and Mc Ilraith s who below we refer to as B&M. and Table 2 shows a representative selection of the results we obtained. |
| Researcher Affiliation | Academia | Jorge Torres and Jorge A. Baier Departamento de Ciencia de la Computaci on Pontificia Universidad Cat olica de Chile Santiago, Chile |
| Pseudocode | Yes | Table 1: The synchronization actions for LTL goal G in NNF. Above ℓ, α R β, α U β, and Ωα are assumed to be in the set of subformulas of G. In addition, ℓis assumed to be a literal. |
| Open Source Code | No | The paper does not contain any statement about making the source code for the described methodology publicly available, nor does it provide a link to a code repository. |
| Open Datasets | Yes | We chose two of the domains (rovers and openstacks) of the 2006 International Planning Competition, which included LTL preferences (but not goals), and generated our own problems, with some of our goals inspired by the preferences. In addition, we considered the blocksworld domain. |
| Dataset Splits | No | The paper discusses planning problems and domains rather than machine learning datasets with explicit training/validation/test splits. The concept of data splitting for model training/validation as typically found in ML papers is not applicable here. |
| Hardware Specification | No | The paper states 'We used an 800MHz CPU machine running Linux.' This provides a general type and speed but not a specific CPU model or other detailed hardware components like GPU models. |
| Software Dependencies | No | The paper mentions using 'LAMA' and 'FFX' planners and that 'Our translator was implemented in SWI-Prolog', but it does not provide specific version numbers for any of these software dependencies. |
| Experiment Setup | Yes | Processes were limited to 1 GB of RAM and 15 min. runtime. |