Inductive Certificates of Unsolvability for Domain-Independent Planning

Eriksson, Salomé and Röger, Gabriele and Helmert, Malte. (2018) Inductive Certificates of Unsolvability for Domain-Independent Planning. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp. 5244-5248.

[img] PDF - Published Version

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

Downloads: Statistics Overview


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.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Eriksson, Salomé and Röger, Gabriele and Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:International Joint Conferences on Artificial Intelligence
Note:Publication type according to Uni Basel Research Database: Conference paper
Identification Number:
edoc DOI:
Last Modified:31 Jan 2019 12:15
Deposited On:12 Oct 2018 14:05

Repository Staff Only: item control page