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

L. D. Raedt, Logical settings for concept-learning, Artificial Intelligence, vol.95, pp.187-201, 1997.

A. Bundy, B. Silver, and D. Plummer, An analytical comparison of some rule-learning programs, Artificial Intelligence, vol.27, pp.137-181, 1985.

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

G. Sablon, L. D. Readt, and M. Bruynooghe, Iterative version spaces, Artificial Intelligence, vol.69, pp.393-409, 1994.

P. Clark and T. Niblett, Induction in noisy domains, Proceedings of the 2nd European Working Session on Learning, pp.11-30, 1987.

H. Hirsh and W. W. Cohen, In: Learning from data with bounded inconsistency: theoretical and experimental results. Volume I: Constraints and Prospects, pp.355-380, 1994.

H. Hirsh, Generalizing version spaces, Machine Learning, vol.17, pp.5-46, 1994.

M. Sebag, Delaying the choice of bias: a disjunctive version space approach, Proceedings of the 13th International Conference on Machine Learning, pp.444-452, 1996.
URL : https://hal.archives-ouvertes.fr/hal-00116418

M. Sebag, Constructive induction: A version space-based approach, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp.708-713, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00116569

J. Lin, Integration of weighted knowledge bases, Artificial Intelligence, vol.83, pp.363-378, 1996.

P. Z. Revesz, On the semantics of arbitration, Journal of Algebra and Computation, vol.7, issue.2, pp.133-160, 1997.

S. Konieczny, J. Lang, and P. Marquis, Distance based merging: A general framework and some complexity results, Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning, pp.97-108, 2002.

L. G. Valiant, Learning disjuctions of conjunctions, Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp.207-232, 1985.

L. G. Valiant, Circuits of the Mind, 1994.

V. Chvatal, A greedy heuristic for the set covering problem, Mathematics of Operation Research, vol.4, pp.233-235, 1979.

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proceedings of the 25th ACM Symposium on the Theory of Computing, pp.286-295, 1993.

J. R. Quinlan, C4.5: Programs for Machine Learning, 1993.

J. R. Quinlan, Improved use of continuous attributes in C4.5, Journal of Artificial Intelligence Research, vol.4, pp.77-90, 1996.

J. Dougherty, R. Kohavi, and M. Sahami, Supervised and unsupervised discretization of continuous features, Proceedings of the 12th International Conference on Machine Learning, pp.194-202, 1995.

M. Kearns, Y. Mansour, A. Y. Ng, and D. Ron, An experimental and theoretical comparison of model selection methods, View publication stats View publication stats, vol.27, pp.7-50, 1997.