Reduction strings: A representation of symbolic hierarchical graphs suitable for learning

Abstract

This paper proposes a new possible way to represent a symbolic graph pyramid built by successive applications of some rules. This representation is targeted for learning the rules, since it contains information about which rules were applied, but also because it can be used to easily define the space of all possible pyramids as a reduction tree. We also consider restraining the possible rules to some basic ones in order to make the reduction trees easy to build, and a way to use them for learning will be presented. © Springer-Verlag Berlin Heidelberg 2005.