Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data

Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence

Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications

Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory

Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

Discovering New Knowledge from Graph Data Using Inductive Logic Programming

ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming

Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory

Ordered term tree languages which are polynomial time inductively inferable from positive data

Theoretical Computer Science - Algorithmic learning theory(ALT 2002)

Exact Learning of Finite Unions of Graph Patterns from Queries

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory

A polynomial time matching algorithm of structured ordered tree patterns for data mining from semistructured data

ILP'02 Proceedings of the 12th international conference on Inductive logic programming

A polynomial time matching algorithm of ordered tree patterns having height-constrained variables

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching