∃-STRIPS: Existential Quantification in Planning and Constraint Satisfaction
Authors: Guillem Francès, Hector Geffner
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Experiments are reported comparing our native 9STRIPS planner with state-of-the-art STRIPS planners over compiled and propositional encodings, and with a Functional STRIPS planner. |
| Researcher Affiliation | Academia | Guillem Franc es Universitat Pompeu Fabra Barcelona, Spain guillem.frances@upf.edu Hector Geffner ICREA & Universitat Pompeu Fabra Barcelona, Spain hector.geffner@upf.edu |
| Pseudocode | No | The paper describes algorithms but does not contain clearly labeled pseudocode or algorithm blocks. |
| Open Source Code | Yes | The source code of ES plus all problem encodings are available on gfrances.github.io/pubs. |
| Open Datasets | Yes | We use two sets of instances: first, random instances (100 <= n <= 500, 10 <= k <= 30) where the graph results from adding edges at random to a uniform spanning tree to reach a certain graph density; second, standard instances from a public compilation from the literature, of which we have pruned those instances reported as not solvable in less than 1 hour by state-of-the-art coloring methods or having a chromatic number chi > 10. From the remaining instances, we generate planning problems with a number of colors k in {chi, chi + 1}. https://sites.google.com/site/graphcoloring/ |
| Dataset Splits | No | The paper does not provide explicit training/validation/test dataset split percentages, absolute counts, or references to predefined splits for reproduction. |
| Hardware Specification | Yes | All planners run a maximum of 30 minutes on a cluster with AMD Opteron 6300@2.4Ghz nodes, and are allowed a maximum of 8GB of memory. |
| Software Dependencies | No | The paper mentions the Gecode CP solver but does not specify its version number. Other software like Fast-Downward is mentioned without specific versioning. |
| Experiment Setup | Yes | FD is configured with the same search strategy; namely, greedy BFS with the h FF heuristic, a single queue, no EHC, and non-delayed evaluation. |