System ATRE - inductive inference of recursive theories
References [1, 2]

ATRE addresses the problem of inductive inference of recursive theories. A separate-and-parallel-conquer search strategy is adopted to interleave the learning of clauses of mutually recursive predicate definitions. Problems caused by the non-monotonicity of the consistency property are solved by reformulating the currently learned theory before adding a new clause. ATRE is characterized by an object-centered representation of training examples and by the use of seed objects.


  1. D. Malerba, F. Esposito, & F.A. Lisi (1998). Learning recursive theories with ATRE, in H. Prade (Ed.), Proceedings of the 13th European Conference on Artificial Intelligence, 435-439, John Wiley & Sons, Chichester, England.
  2. F. Esposito, D. Malerba, & F.A. Lisi (2000). Induction of recursive theories in the normal ILP setting: issues and solutions, in J. Cussens and A. Frisch (Eds.) Inductive Logic Programming, Lecture Notes in Artificial Intelligence, 1866, 93-111, Springer, Berlin, Germany.

back to index