Abstracting Abstraction in Search II: Complexity Analysis
2012 (English)In: Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 / [ed] Daniel Borrajo, Ariel Felner, Richard Korf, Maxim Likhachev, Carlos Linares Lopez, Wheeler Ruml, and Nathan Sturtevant, AAAI Press, 2012, 10-17 p.Conference paper (Refereed)
Modelling abstraction as a function from the original state space to an abstract state space is a common approach in combinatorial search. Sometimes this is too restricted, though, and we have previously proposed a framework using a more flexible concept of transformations between labelled graphs. We also proposed a number of properties to describe and classify such transformations. This framework enabled the modelling of a number of different abstraction methods in a way that facilitated comparative analyses. It is of particular interest that these properties can be used to capture the concept of refinement without backtracking between levels; how to do this has been an open question for at least twenty years. In this paper, we continue our previous research by analysing the complexity of testing the various transformation properties for both explicit and implicit graph representations.
Place, publisher, year, edition, pages
AAAI Press, 2012. 10-17 p.
IdentifiersURN: urn:nbn:se:liu:diva-79511ISBN: 978-1-57735-584-7OAI: oai:DiVA.org:liu-79511DiVA: diva2:543171
5th Annual Symposium on Combinatorial Search (SoCS-2012), July 19-21, Niagara Falls, Canada