Skip navigation
Skip navigation

Computing Upper Bounds on Lengths of Transition Sequences

Rintanen, Jussi; Gretton, Charles

Description

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

CollectionsANU Research Publications
Date published: 2013
Type: Conference paper
URI: http://hdl.handle.net/1885/66518
Source: IJCAI International Joint Conference on Artificial Intelligence

Download

File Description SizeFormat Image
01_Rintanen_Computing_Upper_Bounds_on_2013.pdf603.84 kBAdobe PDF


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator