issues
search
circuithub
/
fast-downward
Solve classical planning problems (STRIPS/SAS+) using Haskell & Fast Downward
BSD 3-Clause "New" or "Revised" License
32
stars
5
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Running the example does not find a plan
#11
dan-blank
closed
3 months ago
3
Cannot run example
#10
TernaryM01
opened
3 years ago
1
Trivial solution for trivial goals.
#9
luke-clifton
opened
4 years ago
1
Prevent planner from locking up on large problems.
#8
luke-clifton
opened
4 years ago
7
bjolp not exported?
#7
rberenguel
closed
4 years ago
1
Add requiresAxioms
#6
ocharles
closed
5 years ago
0
1.2.03.0 -> 1.2.3.0
#5
phadej
closed
5 years ago
1
Prevail unchanged writes
#4
ocharles
closed
5 years ago
0
Use continuations for faster Effect evaluation
#3
ocharles
closed
5 years ago
0
Enforce writeVar v >=> readVar === return
#2
ocharles
closed
5 years ago
0
Derive instance MonadFail Effect, bump base upper bound
#1
mitchellwrosen
closed
5 years ago
3