Helmert, Malte; Haslum, Patrik; Hoffmann, Jorg; Nissim, Raz
Many areas of computer science require answering questions about reachability in compactly described discrete transition systems. Answering such questions effectively requires techniques to be able to do so without building the entire system. In particular, heuristic search uses lower-bounding ("admissible") heuristic functions to prune parts of the system known to not contain an optimal solution. A prominent technique for deriving such bounds is to consider abstract transition systems that...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.