Skip navigation
Skip navigation

Mechanising Theoretical Upper Bounds in Planning

Mansour (Abdulaziz), Mohammad; Gretton, Charles; Norrish, Michael

Description

We examine the problem of computing upper bounds on the lengths of plans. Tractable approaches to calculating such bounds are based on a decomposition of state-variable dependency graphs (causal graphs). Our contribution follows an existing formalisation of concepts in that setting, reporting our efforts to mechanise bounding inequalities in HOL. Our primary contribution is to identify and repair an important error in the original formalisation of bounds. We also develop novel bounding...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
URI: http://hdl.handle.net/1885/154170
Source: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling
Access Rights: Open Access

Download

File Description SizeFormat Image
01_Mansour+%28Abdulaziz%29_Mechanising_Theoretical_Upper_2015.pdf262.07 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator