On the complexity of dependency inference. Clustering The following paper looks at attribute-oriented induction and shows how it can naturally be viewed as conceptual clustering. The following papers consider the problem of finding occurrences of trees from other trees. The questions are motivated by information retrieval issues. Ordered and unordered tree inclusion.
Query primitives for tree-structured data.
Combinatorial Pattern Matching, Third Workshop, A. Apostolico et al. Proceedings of the 1993 Workshop on Knowledge Discovery in Databases , Washington, D.C., July 1993. An interesting problem is to define a good notion for distances between theories.