Many problems, especially those with a composite structure, can naturally be
expressed in higher order logic. From a KR perspective modeling these problems
in an intuitive way is a challenging task. In this paper we study the graph
mining problem as an example of a higher order problem