listic due to its high computational cost. A cheaper, though also weaker, alternative, is to use frequent subgraph mining algorithms such as RIWP03, IiKOIJ, which may straightforwardly be adapted to hypergraphs such as the Atomspace. Frequent subgraph mining is a port to the graph domain of the older,