{"type":"ScholarlyArticle","title":"Towards Certified Unsolvability in Classical Planning","authors":[{"name":"Gabriele Röger","slug":"gabriele-roger","given":"Gabriele","family":"Röger","affiliation":"University of Basel , Switzerland"}],"abstract":"While it is easy to verify that an action sequence is a solution for a classical planning task, there is no such verification capability if a task is reported unsolvable. We are therefore interested in certificates that allow an independent verification of the absence of solutions. We identify promising concepts for certificates that can be generated by a wide range of planning approaches. We present a first proposal of unsolvability certificates and sketch ideas how the underlying concepts can be used as part of a more flexible unsolvability proof system.","doi":"10.24963/ijcai.2017/738","url":"https://ijcai.org/proceedings/2017/738","pdf":"https://ijcai.org/proceedings/2017/0738.pdf","markdown":"https://ijcai.org/proceedings/2017/738.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/738","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Early Career","track":"Early Career","number":738,"pages":{"first":5141,"last":5145},"keywords":["Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Alcázar and Torralba, 2015] Vidal Alcázar and Álvaro Tor- ralba. A reminder about the importance of computing and exploiting invariants in planning. In Proc. ICAPS 2015, pages 2-6, 2015.","title":"Vidal Alcázar and Álvaro Torralba. A reminder about the importance of computing and exploiting invariants in planning","authors":"Torralba Alcázar","year":"2015","venue":"Proc. ICAPS 2015","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäckström et al., 2013] Christer Bäckström, Peter Jonsson, and Simon Ståhlberg. Fast detection of unsolvable plan- ning instances using local consistency. In Proc. SoCS 2013, pages 29-37, 2013.","title":"Fast detection of unsolvable planning instances using local consistency","authors":"Christer Bäckström, Peter Jonsson, Simon Ståhlberg","year":"2013","venue":"Proc. SoCS 2013","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Balyo and Suda, 2016] Tomáš Balyo and Martin Suda. Reachlunch entering the Unsolvability IPC 2016. In Un- solvability IPC: planner abstracts, pages 3-5, 2016.","title":"Reachlunch entering the Unsolvability IPC 2016","authors":"Suda Balyo, Tomáš Balyo, Martin Suda","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. AIJ, 129(1):5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Domshlak et al., 2015] Carmel Domshlak, Jörg Hoffmann, and Michael Katz. Red-black planning: A new system- atic approach to partial delete relaxation. AIJ, 221:73-114, 2015.","title":"Red-black planning: A new systematic approach to partial delete relaxation","authors":"Domshlak","year":"2015","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Edelkamp and Helmert, 2001] Stefan Edelkamp and Malte Helmert. The model checking integrated planning system (MIPS). AI Magazine, 22(3):67-71, 2001.","title":"The model checking integrated planning system (MIPS)","authors":"Helmert Edelkamp, Stefan Edelkamp, Malte Helmert","year":"2001","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. In Proc. ECP 2001, pages 84-90, 2001.","title":"Planning with pattern databases","authors":"Stefan Edelkamp","year":"2001","venue":"Proc. ECP 2001","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Eriksson et al., 2017] Salomé Eriksson, Gabriele Röger, and Malte Helmert. Unsolvability certificates for classi- cal planning. In Proc. ICAPS 2017, 2017.","title":"Unsolvability certificates for classical planning","authors":"Salomé Eriksson, Gabriele Röger, Malte Helmert","year":"2017","venue":"Proc. ICAPS 2017","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gnad et al., 2016a] Daniel Gnad, Marcel Steinmetz, and Jörg Hoffmann. Django: Unchaining the power of red- black planning. In Unsolvability IPC: planner abstracts, pages 19-22, 2016.","title":"Django: Unchaining the power of redblack planning","authors":"Gnad","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gnad et al., 2016b] Daniel Gnad, Álvaro Torralba, Jörg Hoffmann, and Martin Wehrle. Decoupled search for prov- ing unsolvability. In Unsolvability IPC: planner abstracts, pages 16-18, 2016.","title":"Decoupled search for proving unsolvability","authors":"Gnad","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Haslum and Geffner, 2000] Patrik Haslum and Héctor Geffner. Admissible heuristics for optimal planning. In Proc. AIPS 2000, pages 140-149, 2000.","title":"Admissible heuristics for optimal planning","authors":"Geffner Haslum, Patrik Haslum, Héctor Geffner","year":"2000","venue":"Proc. AIPS 2000","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Haslum, 2016] Patrik Haslum. Adapting h ++ for proving plan non-existence. In Unsolvability IPC: planner ab- stracts, pages 1-1, 2016.","title":"Adapting h ++ for proving plan non-existence","authors":"Patrik Haslum, Haslum","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":13,"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. JACM, 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":"JACM","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoffmann and Fickert, 2015] Jörg Hoffmann and Maximil- ian Fickert. Explicit conjunctions w/o compilation: Com- puting h FF (Π C ) in polynomial time. In Proc. ICAPS 2015, pages 115-119, 2015.","title":"Explicit conjunctions w/o compilation: Computing h FF (Π C ) in polynomial time","authors":"Fickert Hoffmann, Jörg Hoffmann, Maximilian Fickert","year":"2015","venue":"Proc. ICAPS 2015","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.","title":"The FF planning system: Fast plan generation through heuristic search","authors":"Nebel Hoffmann, Jörg Hoffmann, Bernhard Nebel","year":"2001","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":16,"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 Proc. ECAI 2014, pages 441-446, 2014.","title":"Distance\"? Who cares? Tailoring merge-and-shrink heuristics to detect unsolvability","authors":"Hoffmann","year":"2014","venue":"Proc. ECAI 2014","doi":null,"url":null,"internal_url":null},{"position":17,"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 ICAPS 2003 Workshop on the Competition, 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":"ICAPS 2003 Workshop on the Competition","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Katz et al., 2013] Michael Katz, Jörg Hoffmann, and Carmel Domshlak. Who said we need to relax all vari- ables? In Proc. ICAPS 2013, pages 126-134, 2013.","title":"Who said we need to relax all variables?","authors":"Michael Katz, Jörg Hoffmann, Carmel Domshlak","year":"2013","venue":"Proc. ICAPS 2013","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kautz and Selman, 1992] Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI 1992, pages 359- 363, 1992.","title":"Planning as satisfiability","authors":"Henry Kautz, Bart Selman","year":"1992","venue":"Proc. ECAI 1992","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Keyder et al., 2014] Emil Keyder, Jörg Hoffmann, and Patrik Haslum. Improving delete relaxation heuris- tics through explicitly represented conjunctions. JAIR, 50:487-533, 2014.","title":"Improving delete relaxation heuristics through explicitly represented conjunctions","authors":"Keyder","year":"2014","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Korovin and Suda, 2016] Konstantin Korovin and Martin Suda. iProverPlan: a system description. In Unsolvability IPC: planner abstracts, pages 6-7, 2016.","title":"iProverPlan: a system description","authors":"Suda Korovin, Konstantin Korovin, Martin Suda","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lipovetzky et al., 2016] Nir Lipovetzky, Christian Muise, and Hector Geffner. Traps, invariants, and dead-ends. In Proc. ICAPS 2016, pages 211-215, 2016.","title":"Traps, invariants, and dead-ends","authors":"Nir Lipovetzky, Christian Muise, Hector Geffner","year":"2016","venue":"Proc. ICAPS 2016","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[McConnell et al., 2011] Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer. Certify- ing algorithms. Computer Science Review, 5(2):119-162, 2011.","title":"Certifying algorithms","authors":"Ross M Mcconnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer","year":"2011","venue":"Computer Science Review","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pommerening and Seipp, 2016] Florian Pommerening and Jendrik Seipp. Fast Downward dead-end pattern database. In Unsolvability IPC: 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 IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non- negative to general operator cost partitioning. In Proc. AAAI 2015, pages 3335-3341, 2015.","title":"From nonnegative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proc. AAAI 2015","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Seipp et al., 2016] Jendrik Seipp, Florian Pommerening, Silvan Sievers, Martin Wehrle, Chris Fawcett, and Yusra Alkhazraji. Fast Downward Aidos. In Unsolvability IPC: planner abstracts, pages 28-38, 2016.","title":"Fast Downward Aidos","authors":"Seipp","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Steinmetz and Hoffmann, 2017a] Marcel Steinmetz and Jörg Hoffmann. Search and learn: On dead-end detectors, the traps they set, and trap learning. In Proc. IJCAI 2017, 2017.","title":"Search and learn: On dead-end detectors, the traps they set, and trap learning","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2017","venue":"Proc. IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/614"},{"position":28,"raw":"[Steinmetz and Hoffmann, 2017b] Marcel Steinmetz and Jörg Hoffmann. State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. AIJ, 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":"AIJ","doi":null,"url":null,"internal_url":null},{"position":29,"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 IPC: 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 IPC: planner abstracts","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Torralba, 2016] Álvaro Torralba. Sympa: Symbolic perime- ter abstractions for proving unsolvability. In Unsolvability IPC: planner abstracts, pages 8-11, 2016.","title":"Sympa: Symbolic perimeter abstractions for proving unsolvability","authors":"Álvaro Torralba, Torralba","year":"2016","venue":"Unsolvability IPC: planner abstracts","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}