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 Coakley et alK. L. Coakley, T. Snelleman, H. Hoos, and O. E. Gundersen, "The embrace of open science: An analysis of a decade of AI research and 56 800 conference papers," Under Review, 2026..
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces
Authors: Akihiro Kishimoto, Adi Botea, Radu Marinescu
IJCAI 2019 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We demonstrate the performance in domain-independent nondeterministic planning. ... 6 Experimental Results We use domain-independent nondeterministic planning with unit edge costs and the ADD model to evaluate RBFAOOr and BLDFSr. |
| Researcher Affiliation | Industry | Akihiro Kishimoto , Adi Botea and Radu Marinescu IBM Research, Ireland EMAIL |
| Pseudocode | Yes | Algorithm 1 RBFAOOr: RBFAOO with our approach ... Algorithm 6 BLDFS Driver with our approach |
| Open Source Code | No | The paper states 'We coded all algorithms in C++ (64-bit)' but does not provide a link or explicit statement about releasing the source code for the work described in this paper. |
| Open Datasets | Yes | We use instances from the Uncertainty Track in the 6th International Planning Competition in 2008, consisting of BWD (blocksworld, 30 instances), FLTS (faults, 55 instances) and FRES (ο¬rst-responders, 100 instances). ... as described in [Fu et al., 2013]. |
| Dataset Splits | No | The paper evaluates algorithms on problem instances for searching and planning, which does not involve traditional training/validation/test dataset splits as typically found in machine learning contexts. |
| Hardware Specification | Yes | We coded all algorithms in C++ (64-bit) and ran experiments on an Intel Xeon CPU X5690 processor at 3.47GHz. |
| Software Dependencies | No | The paper mentions 'C++ (64-bit)' and specific techniques like 'Small Tree GC [Nagai, 1999]' and 'hmax heuristic', but does not provide version numbers for any specific compilers, libraries, or external software used. |
| Experiment Setup | Yes | The TT is limited to 1GB. ... we set R to 30. ... The time per instance is 30 minutes. ... We select 5% of the grounded predicates. |