{"type":"ScholarlyArticle","title":"Computing Upper Bounds on Lengths of Transition Sequences","authors":[{"name":"Jussi Rintanen","slug":"jussi-rintanen","given":"Jussi","family":"Rintanen","affiliation":""},{"name":"Charles Orgill Gretton","slug":"charles-orgill-gretton","given":"Charles Orgill","family":"Gretton","affiliation":""}],"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 bounds in a number of planning benchmarks. Computing the bounds is computationally cheap in practice, and in a number of benchmarks our algorithm runs in polynomial time in the number of actions and propositional variables that characterize the problem.","doi":null,"url":"https://ijcai.org/proceedings/2013/348","pdf":"https://ijcai.org/proceedings/2013/0348.pdf","markdown":"https://ijcai.org/proceedings/2013/348.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/348","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":348,"pages":{"first":2365,"last":2371},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}