This archive contains the code, benchmarks, and experimental data for the paper titled "Symbolic Search for Cost-Optimal Planning with Expressive Model Extensions". Code The file planners.zip contains our code for conducting symbolic search with BDDs and EVMDDs, along with the code for all other planners used for comparison (references can be found in the included Readme file). Benchmarks The file benchmarks.zip contains the benchmarks with conditional effects, axioms, and/or state-dependent action costs that we used for the empirical comparison. Experiment Data The remaining files (experiments_X.zip) contain the experiment scripts, raw and parsed data, and reports for the experiments described in the paper, organized by individual sections.

This work was partially supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation and by TAILOR, a project funded by the EU Horizon 2020 research and innovation programme under grant agreement no. 952215. The computations were enabled by resources provided by the National Academic Infrastructure for Supercomputing in Sweden (NAISS) partially funded by the Swedish Research Council through grant agreement no. 2022-06725. David Speck was funded by the Swiss National Science Foundation (SNSF) as part of the project "Unifying the Theory and Algorithms of Factored State-Space Search" (UTA).