Efficient Sat Encodings For Hierarchical Planning | 0 | 0.34 | 2019 |
Unbounded Software Model Checking with Incremental SAT-Solving. | 0 | 0.34 | 2018 |
Optimal Longest Paths by Dynamic Programming. | 0 | 0.34 | 2017 |
Accelerating SAT Based Planning with Incremental SAT Solving. | 0 | 0.34 | 2017 |
On Different Strategies for Eliminating Redundant Actions from Plans. | 1 | 0.35 | 2014 |