A Proof System for Unsolvable Planning Tasks

Eriksson, Salomé and Röger, Gabriele and Helmert, Malte. (2018) A Proof System for Unsolvable Planning Tasks. In: Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018). pp. 65-73.

[img] PDF - Published Version

Official URL: https://edoc.unibas.ch/64927/

Downloads: Statistics Overview


While traditionally classical planning concentrated on finding plans for solvable tasks, detecting unsolvable instances has recently attracted increasing interest. To preclude wrong results, it is desirable that the planning system provides a certificate of unsolvability that can be independently verified. We propose a rule-based proof system for unsolvability where a proof establishes a knowledge base of verifiable basic statements and applies a set of derivation rules to infer the unsolvability of the task from these statements. We argue that this approach is more flexible than a recent proposal of inductive certificates of unsolvability and show how our proof system can be used for a wide range of planning techniques.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Röger, Gabriele and Helmert, Malte and Eriksson, Salomé
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:12 Oct 2018 13:18
Deposited On:29 Aug 2018 08:44

Repository Staff Only: item control page