Published March 2, 2020 | Version v1
Software Open

Code from Eriksson-Helmert, ICAPS 2020

  • 1. University of Basel, Switzerland

Description

This code package consist of three parts:

  1. DFS-CL: an extension to the DFS-CL algorithm by Marcel Steinmetz which allows generation of proofs for the uc heuristic.
  2. fast-downward: an extension to Fast Downward which allows generation of proofs for A* with hmax, hm and M&S heuristics.
  3. A standalone verifier which is able to verify proofs.

The modified version of PDRplan used in the paper can be found in 10.5281/zenodo.3694110.

Files

eriksson-helmert-icaps2020-code.zip

Files (5.6 MB)

Name Size Download all
md5:f41fd293a330791424fae0c5422629a7
5.6 MB Preview Download

Additional details

Related works

Compiles
Dataset: 10.5281/zenodo.3691812 (DOI)
Is supplemented by
Software: 10.5281/zenodo.3694110 (DOI)

Funding

Swiss National Science Foundation
Certified Correctness and Guaranteed Performance for Domain-Independent Planning (CCGP-Plan) 200021_182107