Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet functions for contraction and revision. J. Symbolic Logic 50, 510–530 (1985)
2. Arias, M., Khardon, R., Maloberti, J.: Learning Horn expressions with LogAn-H, Tufts University Computer Science Technical Report 2005-4
3. Cohen, W.W., Page, C.D.: Polynomial learnability and inductive logic programming: methods and results. New Generation Computing 13, 369–409 (1995)
4. Frazier, M., Pitt, L.: CLASSIC learning. Machine Learning 25, 151–193 (1996)
5. Getoor, L., Friedman, N., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Džeroski, S., Lavrač, N. (eds.) Relational Data Mining, pp. 307–335. Kluwer, Dordrecht (2001)