This paper proposes an algorithm for relational frequent pattern mining based on logical structure of examples. It uses bottom-up property extraction from examples. The extracted properties construct patterns by two operations. One of the operations combines patterns as their conjunction, and the other makes a pattern as it keeps structure appeared in examples. We show a kind of downward closure property among patterns constructed by the operations. By using the property we give a mining

more »

... hm and show its correctness. We also prove that it does not produce redundant patterns in the sense of logical equivalence.