C. Anglano, A. Giordana, G. Lo-bello, and L. Saitta, An experimental evaluation of coevolutive concept learning, Proc. of the 15th ICML, pp.19-27, 1998.

H. Blockeel and L. De-raedt, Top-down induction of first order logical decision trees, Artificial Intelligence, vol.101, issue.1-2, pp.285-297, 1998.

A. Borgida, On the relative expressiveness of description logics and predicate logics, Artificial Intelligence, vol.82, pp.353-367, 1996.

M. Botta, A. Giordana, and R. Piola, FONN: Combining first order logic with connectionist learning, Proc. of ICML-97, pp.48-56, 1997.

Y. Boufkhad, Algorithms for propositional KB approximation, Proc. of AAAI-98, pp.280-285, 1998.

R. J. Brachman, A structural paradigm for representing knowledge, 1977.

L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression by tree, 1984.

M. Cadoli, Semantical and computational aspects of Horn approximations, Proc. of IJCAI-93, pp.39-44, 1993.

W. F. Clocksin and C. S. Mellish, Programming in Prolog, 1981.

J. M. Crawford and D. W. Etherington, A non-deterministic semantics for tractable inference, Proc. of AAAI-98, pp.286-291, 1998.

J. M. Crawford and B. Kuiper, Toward a theory of access-limited logic for knowledge representation, Proc. of KR-89, pp.67-78, 1989.

J. Cussens, Part-of-speech tagging using Progol, Proc. of ILP-97, vol.1297, pp.93-108, 1997.

L. De-raedt, Induction in logic, Proc. of 3rd International Workshop on Multistrategy Learning, pp.29-38, 1996.

L. De-raedt and S. D?eroski, First order jk-clausal theories are PAC-learnable, Artificial Intelligence, vol.70, pp.375-392, 1994.

L. De-raedt, P. Idestam-almquist, and G. Sablon, ). -subsumption for structural matching, 1997.

, Proc. of the 9th European Conference on Machine Learning, pp.73-84

T. G. Dietterich, R. Lathrop, and T. Lozano-perez, Solving the multiple-instance problem with axis-parallel rectangles, Artificial Intelligence, vol.89, issue.1-2, pp.31-71, 1997.

D. Dolsak and S. Muggleton, The application of ILP to finite element mesh design, Proc. of the 1st ILP, pp.453-472, 1991.

W. Emde and D. Wettscherek, Relational instance based learning, Proc. of the 13th ICML, pp.122-130, 1996.

F. Esposito, A. Laterza, D. Malerba, and G. Semeraro, Locally finite, proper and complete operators for refining datalog programs, Foundations of intelligent systems, pp.468-478, 1996.

E. Feigenbaum, The art of artificial intelligence: themes and case studies in knowledge engineering, Proc. of IJCAI'77, pp.1014-1029, 1977.

A. Giordana and F. Neri, Search intensive concept induction, Evolutionary Computation, vol.3, issue.4, pp.375-416, 1994.

A. Giordana, M. Botta, and L. Saitta, An experimental study of phase transitions in matching, Proc. of IJCA'99, pp.1199-1203, 1999.

D. Haussler, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Artificial Intelligence, vol.36, pp.177-221, 1988.

J. Jaffar and J. L. Lassez, Constraint logic programming. Proc. of the fourteenth ACM Symposium on the Principles of Programming Languages, pp.111-119, 1987.

D. Kapur and P. Narendran, NP-completeness of the set unification and matching problems, Proc. of 8th Conference on Automated Deduction, vol.230, pp.489-495, 1986.

A. Karalic, First order regression, Jal of the ACM, vol.44, issue.5, pp.697-725, 1995.

R. D. King, A. Srinivasan, and M. J. Sternberg, Relating chemical activity to structure: an examination of ILP successes, New Gen. Comput, vol.13, pp.411-433, 1995.

J. Kivinen and H. Mannila, Approximate inference of functional dependencies from relations, Theoretical Computer Science, vol.149, pp.129-149, 1995.

Y. Kodratoff and J. Ganascia, Improving the generalization step in learning, Machine learning: an artificial intelligence approach, vol.2, pp.215-244, 1986.

R. Kohavi and G. H. John, Automatic parameter selection by minimizing estimated error, Proc. of the 12th ICML, pp.304-312, 1995.

N. Lavra? and S. D?eroski, Inductive logic programming: techniques and applications, 1994.

N. Lavra?, D. Gamberger, and S. D?eroski, An approach to dimensionality reduction in learning from deductive databases, Proc. of Inductive Logic Programming-95, pp.337-354, 1995.

J. W. Lloyd, Foundations of logic programming, 1987.

J. W. Lloyd, Programming in an integrated functional and logic language, Journal of Functional and Logic Programming, 1999.

P. Marquis, Knowledge compilation using prime implicants, Proc. of IJCAI-95, pp.837-843, 1995.

R. S. Michalski, A theory and methodology of inductive learning, Machine learning: an artificial intelligence approach, vol.1, pp.83-134, 1983.

T. M. Mitchell, Generalization as search, Artificial Intelligence, vol.18, pp.203-226, 1982.

T. M. Mitchell, Machine learning, 1997.

D. Mitchell, B. Selman, and H. Levesque, Hard and easy distributions of SAT problems, Proc. of AAAI-92, pp.459-465, 1992.

S. Muggleton, Inverse entailment and PROGOL, New Gen. Comput, vol.13, pp.245-286, 1995.

S. Muggleton and L. De-raedt, Inductive logic programming: Theory and methods, Journal of Logic Programming, vol.19, pp.629-679, 1994.

C. Nédellec, C. Rouveirol, H. Adé, F. Bergadano, and B. Tausend, Declarative bias in ILP, Advances in ILP, pp.82-103, 1996.

S. W. Norton and H. Hirsh, Learning DNF via probabilistic evidence combination, Proc. of the 10th ICML, pp.220-227, 1993.

P. F. Patel-schneider, A decidable first-order logic for knowledge representation, Journal of Automated Reasoning, vol.6, pp.361-388, 1990.

M. Pazzani and D. Kibler, The role of prior knowledge in inductive learning, Machine Learning, vol.9, pp.54-97, 1992.

G. Plotkin, A note on inductive generalization, Machine intelligence, vol.5, pp.153-163, 1970.

J. R. Quinlan, Learning logical definition from relations, Machine Learning, vol.5, pp.239-266, 1990.

R. Reiter and J. De-kleer, Foundations of assumption-based truth maintenance systems: preliminary report, Proc. of AAAI-87, pp.183-188, 1987.

J. Rissanen, Modelling by shortest data description, Automatica, vol.14, pp.465-471, 1978.

C. Rouveirol, Flattening and saturation: Two representation changes for generalisation, Machine Learning, vol.14, pp.219-232, 1994.

S. Russell and A. Norwig, Artificial intelligence, a modern approach, 1995.

M. Sebag, Using constraints to building version spaces, Proc. of ECML-94, European conference on machine learning, pp.257-271, 1994.

M. Sebag, 2nd order understandability of disjunctive version spaces, Workshop on machine learning and comprehensibility, IJCAI-95, 1995.

M. Sebag, Delaying the choice of bias: A disjunctive version space approach, Proc. of the 13th ICML, pp.444-452, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00116418

M. Sebag and C. Rouveirol, Tractable induction and classification in FOL, Proc. of IJCAI-97, pp.888-892, 1997.

B. Selman and H. Kautz, Knowledge compilation and theory approximation, Jal of the ACM, vol.43, issue.2, pp.193-224, 1996.

H. Simon, Models of bounded rationality, 1982.

E. N. Smirnov and P. J. Braspenning, Version space learning with instance-based boundary sets, Proc. of European Conf. on Artificial Intelligence, 1998.

B. D. Smith and P. S. Rosembloom, Incremental non-backtracking focusing: A polynomially bounded generalization algorithm for version space, Proc. of AAAI-90, pp.848-853, 1990.

A. Srinivasan and S. Muggleton, Comparing the use of background knowledge by two ILP systems, Proc. of Inductive Logic Programming-95, 1995.

A. Srinivasan, S. H. Muggleton, M. J. Sternberg, and R. D. King, Theories for mutagenicity: a study in first order and feature-based induction, Artificial Intelligence, vol.85, pp.277-299, 1996.

A. Srinivasan, The predictive toxicology evaluation challenge, Proc. of IJCAI-97, pp.4-8, 1997.

S. Zilberstein, Using any-time algorithms in intelligent systems, AI Magazine, vol.17, issue.3, pp.73-83, 1996.

J. Zucker and J. Ganascia, Representation changes for efficient learning in structural domains, Proc. of the 13th ICML, pp.543-551, 1996.