Computing Upper Bounds on Lengths of Transition Sequences
We describe an approach to computing upper bounds on the lengths of solutions to reachability problems in transition systems. It is based on a decomposition of state-variable dependency graphs (causal graphs). Our approach is able to find practical upper
|Collections||ANU Research Publications|
|Source:||IJCAI International Joint Conference on Artificial Intelligence|
|Access Rights:||Open Access|
|01_Rintanen_Computing_Upper_Bounds_on_2013.pdf||603.84 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.