fast-downward: Solve classical planning problems (STRIPS/SAS+) using Haskell & Fast Downward.
fast-downward is a library for modelling classical planning problems and
solving them using the Fast Downward engine. For general usage, see
FastDownward, and for an example see FastDownward.Examples.Gripper.
Note that usage of this library requires the
downward executable - see
Obtaining and Running Fast Downward
for more instructions.
|Versions [faq]||0.1.0.0, 0.1.0.1, 0.1.1.0|
|Dependencies||base (>=18.104.22.168 && <4.12), containers (>=0.5.11.0 && <0.6), list-t (>=1.0.1 && <1.1), mtl (>=2.2.2 && <2.3), process (>=22.214.171.124 && <1.7), temporary (==1.3.*), text (>=126.96.36.199 && <1.3), transformers (>=0.5.5.0 && <0.6) [details]|
|Maintainer||Ollie Charles <email@example.com>|
|Revised||Revision 1 made by OliverCharles at Wed Dec 26 12:46:30 UTC 2018|
|Source repo||head: git clone https://github.com/circuithub/fast-downward|
|Uploaded||by OliverCharles at Tue Dec 25 19:00:42 UTC 2018|
|Downloads||196 total (33 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
- fast-downward-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees