edoc

Towards Certified Unsolvability in Classical Planning

Röger, Gabriele. (2017) Towards Certified Unsolvability in Classical Planning. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. pp. 5141-5145 .

[img] PDF - Published Version
96Kb

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

Downloads: Statistics Overview

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 certifi- cates 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.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Röger, Gabriele
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
ISBN:978-0-9992411-1-0
Note:Publication type according to Uni Basel Research Database: Conference paper
Language:English
Identification Number:
Last Modified:12 Oct 2018 14:12
Deposited On:12 Oct 2018 14:12

Repository Staff Only: item control page