{"type":"ScholarlyArticle","title":"Inductive Certificates of Unsolvability for Domain-Independent Planning","authors":[{"name":"Salomé Eriksson","slug":"salome-eriksson","given":"Salomé","family":"Eriksson","affiliation":"University of Basel , Switzerland"},{"name":"Gabriele Röger","slug":"gabriele-roger","given":"Gabriele","family":"Röger","affiliation":"University of Basel , Switzerland"},{"name":"Malte Helmert","slug":"malte-helmert","given":"Malte","family":"Helmert","affiliation":"University of Basel , Switzerland"}],"abstract":"If a planning system outputs a solution for a given problem, it is simple to verify that the solution is valid. However, if a planner claims that a task is unsolvable, we currently have no choice but to trust the planner blindly. We propose a sound and complete class of certificates of unsolvability which can be verified efficiently by an independent program. To highlight their practical use, we show how these certificates can be generated for a wide range of state-of-the-art planning techniques with only polynomial overhead for the planner.","doi":"10.24963/ijcai.2018/730","url":"https://ijcai.org/proceedings/2018/730","pdf":"https://ijcai.org/proceedings/2018/0730.pdf","markdown":"https://ijcai.org/proceedings/2018/730.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/730","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Sister Conferences Best Papers","track":"Best Sister Conferences","number":730,"pages":{"first":5244,"last":5248},"keywords":["Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving","Planning and Scheduling: Theoretical Foundations of Planning"],"videos":[],"references":[{"position":1,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. Artificial Intelligence, 129(1):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bryant, 1986] Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.","title":"Graph-based algorithms for boolean function manipulation","authors":"Randal E Bryant","year":"1986","venue":"IEEE Transactions on Computers","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Eriksson et al., 2017a] Salomé Eriksson, Gabriele Röger, and Malte Helmert. Certifying Fast Downward. https: //doi.org/10.5281/zenodo.376651, 2017.","title":"Certifying Fast Downward","authors":"Eriksson","year":"2017","venue":null,"doi":"10.5281/zenodo.376651,2017","url":"https://doi.org/10.5281/zenodo.376651,2017","internal_url":null},{"position":4,"raw":"[Eriksson et al., 2017b] Salomé Eriksson, Gabriele Röger, and Malte Helmert. Unsolvability certificates for classical planning. In Proceedings of the Twenty-Seventh Interna- tional Conference on Automated Planning and Scheduling (ICAPS 2017), pages 88-97. AAAI Press, 2017.","title":"Unsolvability certificates for classical planning","authors":"Eriksson","year":"2017","venue":"Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Eriksson et al., 2018] Salomé Eriksson, Gabriele Röger, and Malte Helmert. A proof system for unsolvable plan- ning tasks. In Proceedings of the Twenty-Eighth Interna- tional Conference on Automated Planning and Scheduling (ICAPS 2018). AAAI Press, 2018. In Press.","title":"A proof system for unsolvable planning tasks","authors":"Salomé Eriksson, Gabriele Röger, Malte Helmert","year":"2018","venue":"Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Fikes and Nilsson, 1971] Richard E. Fikes and Nils J. Nils- son. STRIPS: A new approach to the application of the- orem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.","title":"STRIPS: A new approach to the application of theorem proving to problem solving","authors":"Richard E Fikes, Nils J Nilsson","year":"1971","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1971/63"},{"position":7,"raw":"[Gnad et al., 2016] Daniel Gnad, Marcel Steinmetz, and Jörg Hoffmann. Django: Unchaining the power of red-black planning. In Unsolvability International Planning Com- petition: planner abstracts, pages 19-22, 2016.","title":"Django: Unchaining the power of red-black planning","authors":"Daniel Gnad, Marcel Steinmetz, Jörg Hoffmann","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hart et al., 1968] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"Peter E Hart, Nils J Nilsson, Bertram Raphael","year":"1968","venue":"IEEE Transactions on Systems Science and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Haslum, 2011] Patrik Haslum. INVAL. https://github.com/ patrikhaslum/INVAL, 2011. Accessed: 2018-05-25.","title":"Patrik Haslum. INVAL","authors":"Haslum","year":"2011","venue":null,"doi":null,"url":"https://github.com/patrikhaslum/INVAL","internal_url":null},{"position":10,"raw":"[Haslum, 2016] Patrik Haslum. Adapting h ++ for proving plan non-existence. In Unsolvability International Plan- ning Competition: planner abstracts, pages 1-1, 2016.","title":"Patrik Haslum. Adapting h ++ for proving plan non-existence","authors":"Haslum","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Helmert et al., 2007] Malte Helmert, Patrik Haslum, and Jörg Hoffmann. Flexible abstraction heuristics for op- timal sequential planning. In Mark Boddy, Maria Fox, and Sylvie Thiébaux, editors, Proceedings of the Seven- teenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pages 176-183. AAAI Press, 2007.","title":"Flexible abstraction heuristics for optimal sequential planning","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann","year":"2007","venue":"Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Helmert et al., 2014] Malte Helmert, Patrik Haslum, Jörg Hoffmann, and Raz Nissim. Merge-and-shrink abstrac- tion: A method for generating lower bounds in factored state spaces. Journal of the ACM, 61(3):16:1-63, 2014.","title":"Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim","year":"2014","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. Journal of Artificial Intelligence Research, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoffmann et al., 2014] Jörg Hoffmann, Peter Kissmann, and Álvaro Torralba. \"Distance\"? Who cares? Tailor- ing merge-and-shrink heuristics to detect unsolvability. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pages 441-446. IOS Press, 2014.","title":"Distance\"? Who cares? Tailoring merge-and-shrink heuristics to detect unsolvability","authors":"Hoffmann","year":"2014","venue":"Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Howey and Long, 2003] Richard Howey and Derek Long. VAL's progress: The automatic validation tool for PDDL2.1 used in the International Planning Competition. In Stefan Edelkamp and Jörg Hoffmann, editors, Proceed- ings of the ICAPS 2003 Workshop on the Competition: Im- pact, Organisation, Evaluation, Benchmarks, 2003.","title":"VAL's progress: The automatic validation tool for PDDL2.1 used in the International Planning Competition","authors":"Richard Howey, Derek Long","year":"2003","venue":"Proceedings of the ICAPS 2003 Workshop on the Competition: Impact, Organisation, Evaluation, Benchmarks","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lipovetzky et al., 2016] Nir Lipovetzky, Christian Muise, and Hector Geffner. Traps, invariants, and dead-ends. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), pages 211-215. AAAI Press, 2016.","title":"Traps, invariants, and dead-ends","authors":"Nir Lipovetzky, Christian Muise, Hector Geffner","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pommerening and Seipp, 2016] Florian Pommerening and Jendrik Seipp. Fast Downward dead-end pattern database. In Unsolvability International Planning Competition: planner abstracts, pages 2-2, 2016.","title":"Florian Pommerening and Jendrik Seipp. Fast Downward dead-end pattern database","authors":"Seipp Pommerening","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Schaefer, 1976] Thomas J. Schaefer. Complexity of de- cision problems based on finite two-person perfect- information games. In Proceedings of the Eighth Annual ACM Symposium on Theory of Computing (STOC '76), pages 41-49, New York, 1976. ACM Press.","title":"Complexity of decision problems based on finite two-person perfectinformation games","authors":"J Thomas, Schaefer","year":"1976","venue":"Proceedings of the Eighth Annual ACM Symposium on Theory of Computing (STOC '76)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Seipp et al., 2016] Jendrik Seipp, Florian Pommerening, Silvan Sievers, Martin Wehrle, Chris Fawcett, and Yusra Alkhazraji. Fast Downward Aidos. In Unsolvability Inter- national Planning Competition: planner abstracts, pages 28-38, 2016.","title":"Fast Downward Aidos","authors":"Seipp","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Somenzi, 2015] Fabio Somenzi. CUDD 3.0.0. http://vlsi. colorado.edu/ ∼ fabio/, 2015. Accessed: 2018-05-25.","title":"CUDD","authors":"Fabio Somenzi","year":"2018","venue":"CUDD","doi":null,"url":"http://vlsi.colorado.edu/∼fabio/,2015","internal_url":null},{"position":21,"raw":"[Steinmetz and Hoffmann, 2017] Marcel Steinmetz and Jörg Hoffmann. State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. Artificial Intelligence, 245:1-37, 2017.","title":"State space search nogood learning: Online refinement of critical-path dead-end detectors in planning","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Torralba et al., 2016] Álvaro Torralba, Jörg Hoffmann, and Peter Kissmann. MS-Unsat and SimulationDominance: Merge-and-Shrink and dominance pruning for proving un- solvability. In Unsolvability International Planning Com- petition: planner abstracts, pages 12-15, 2016.","title":"MS-Unsat and SimulationDominance: Merge-and-Shrink and dominance pruning for proving unsolvability","authors":"Torralba","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Torralba, 2016] Álvaro Torralba. Sympa: Symbolic perime- ter abstractions for proving unsolvability. In Unsolvability International Planning Competition: planner abstracts, pages 8-11, 2016.","title":"Sympa: Symbolic perimeter abstractions for proving unsolvability","authors":"Álvaro Torralba, Torralba","year":"2016","venue":"Unsolvability International Planning Competition: planner abstracts","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}