University of Basel, Research Group for Artificial Intelligence
Published March 12, 2018 | Version v1
Software Open

Code from Eriksson et al., ICAPS 2018

Authors/Creators

  • 1. University of Basel, Switzerland

Description

This code package consists of 3 parts:

1) Certifying Fast Downward, an extension to Fast Downward which allows generation of proofs for A* with hmax, hm and M&S heuristics.

2) Certifying fd-hc-refinement, an extension to the fd-hc-refinement algorithm by Marcel Steinmetz which allows generation of proofs for the uc heuristic.

3) A standalone verifier which is able to verify proofs.

Files

code-eriksson-et-al-ICAPS2018.zip

Files (3.7 MB)

Name Size Download all
md5:82837b45e689a7ab7453257b117a2485
3.7 MB Preview Download

Additional details

Funding

European Commission
SSX - State Space Exploration: Principles, Algorithms and Applications 336939

References

  • Salomé Eriksson, Gabriele Röger and Malte Helmert. A Proof System for Unsolvable Planning Tasks. In Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS). 2018.