Models of Action Concurrency in Temporal Planning
Authors: Jussi Rintanen
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Section 6 experiments with them. We compare PDDL models to their NDL translations with problems from the 2008 and 2011 planning competitions. Figure 3 illustrates the performance improvements of NDL over PDDL, with a plot of runtimes with both models for instances solved in under 30 minutes. The typical performance gain is between one and three orders of magnitude. The numbers of instances solved in 30 minutes are given in Table 1. |
| Researcher Affiliation | Academia | Department of Computer Science Aalto University, Helsinki, Finland Also affiliated with Griffith University, Brisbane, Australia, and the Helsinki Institute for Information Technology, Finland. |
| Pseudocode | No | The paper includes formal definitions and mathematical formulas but does not contain a clearly labeled 'Pseudocode' or 'Algorithm' block, nor structured steps formatted like code. |
| Open Source Code | No | The paper does not include any statement about releasing source code for the described methodology, nor does it provide a link to a code repository. |
| Open Datasets | No | The paper states it uses 'problems from the 2008 and 2011 planning competitions' which are well-known benchmarks, but it does not provide a specific URL, DOI, repository name, or formal citation *within the body of the paper for the datasets themselves* that would grant concrete access. |
| Dataset Splits | No | The paper describes solving 'problems from the 2008 and 2011 planning competitions' and generating SMT encodings, but it does not explicitly provide training, validation, or test dataset splits. |
| Hardware Specification | Yes | solved the benchmark problems with the Z3 SMT solver on a workstation cluster mostly consisting of mid-range Intel Xeon CPUs from about 2010 to 2012. |
| Software Dependencies | No | The paper mentions using the 'Z3 SMT solver' but does not specify its version number, nor does it list other software dependencies with specific versions. |
| Experiment Setup | Yes | The runtime per instance was limited to 30 minutes. For each instance, we generated SMT encodings for 3n steps, for all n > 0, and solved them one by one until a satisfiable SMT instance (corresponding to a plan) was encountered. |