| Unsolvability certificates for classical planning S Eriksson, G Röger, M Helmert Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017 | 58 | 2017 |
| A proof system for unsolvable planning tasks S Eriksson, G Röger, M Helmert Proceedings of the International Conference on Automated Planning and …, 2018 | 26 | 2018 |
| Certified unsolvability for SAT planning with property directed reachability S Eriksson, M Helmert Proceedings of the International Conference on Automated Planning and …, 2020 | 16 | 2020 |
| Finding and Exploiting LTL Trajectory Constraints in Heuristic Search S Simon, G Röger Eighth Annual Symposium on Combinatorial Search, 2015 | 10 | 2015 |
| Certifying planning systems: witnesses for unsolvability S Eriksson University_of_Basel, 2019 | 4 | 2019 |
| Inductive certificates of unsolvability for domain-independent planning S Eriksson, G Röger, M Helmert International Joint Conferences on Artificial Intelligence, 2018 | 4 | 2018 |
| Optimality Certificates for Classical Planning E Mugdan, R Christen, S Eriksson | 2 | 2022 |
| Detecting Unsolvability Based on Separating Functions R Christen, S Eriksson, F Pommerening, M Helmert | 2 | 2022 |
| A General LTL Framework for Describing Control Knowledge in Classical Planning S Simon Master’s thesis, University of Basel, 2014 | 1 | 2014 |
| CSP-and SAT-based Inference Techniques Applied to Gnomine S Simon | | 2012 |
| Christian Muise4, Alice Petrov4, Florian Pommerening1, Jendrik Seipp5, Silvan Sievers1, and David Speck6 1University of Basel 2IBM TJ Watson Research Center R Christen, S Eriksson, M Katz, E Keyder | | |
| Logic-based Methods for Reasoning About Search in Classical Planning S Simon | | |
Malte HelmertProfessor of Computer Science, University of BaselVerified email at unibas.ch
