Mechanising Theoretical Upper Bounds in Planning
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]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling|
|Access Rights:||Open Access|
|01_Mansour+%28Abdulaziz%29_Mechanising_Theoretical_Upper_2015.pdf||262.07 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.