Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Computing Upper Bounds on Lengths of Transition Sequences

Thumbnail Image

Date

2013

Authors

Rintanen, Jussi
Gretton, Charles

Journal Title

Journal ISSN

Volume Title

Publisher

AAAI Press

Abstract

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

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/66518

Collections

Open Access Research

Source

IJCAI International Joint Conference on Artificial Intelligence

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Rintanen_Computing_Upper_Bounds_on_2013.pdf (603.84 KB)

DSpace software copyright © 2002-2026 LYRASIS