Iterative versionspaces

Artificial Intelligence - Tập 69 - Trang 393-409 - 1994
Gunther Sablon1, Luc De Raedt1, Maurice Bruynooghe1
1Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium

Tài liệu tham khảo

Bundy, 1985, An analytical comparison of some rule-learning programs, Artif. Intell., 27, 137, 10.1016/0004-3702(85)90052-9 1981, Vol. 3 De Raedt, 1992 De Raedt, 1993, A theory of clausal discovery, 1058 Haussler, 1988, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Artif. Intell., 36, 177, 10.1016/0004-3702(88)90002-1 Hirsh, 1992, Polynomial-time learning with version spaces, 117 Korf, 1985, Depth-first iterative deepening: an optimal admissible tree search, Artif. Intell., 27, 97, 10.1016/0004-3702(85)90084-0 Lavrač, 1993 Mellish, 1991, The description identification problem, Artif. Intell., 52, 151, 10.1016/0004-3702(91)90040-Q Mitchell, 1982, Generalization as search, Artif. Intell., 18, 203, 10.1016/0004-3702(82)90040-6 1992 S. Muggleton and L. De Raedt, Inductive logic programming: theory and methods, J. Logic Program. (to appear). Nedellec, 1992, How to specialize by theory refinement, 474 Nicolas, 1991, Empirical bias for version space, 671 Sablon, 1994, Using the event calculus to integrate planning and learning in an intelligent autonomous agent, 254 Sammut, 1986, Learning concepts by asking questions, 2, 167 Smith, 1990, Incremental non-backtracking focusing: a polynomially bounded generalization algorithm for version spaces, 848 Subramanian, 1986, Factorization in experiment generation, 518 Taylor, 1993, Pruning duplicate nodes in depth-first search, 756 Tecuci, 1990, Apprenticeship learning in imperfect domain theories, 3, 514