Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172–191 [Book Review]

Artificial Intelligence 128 (1-2):31-97 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,963

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

If inductive logic programming leads, will data mining follow?Randy Goebel - forthcoming - Proceedings of the Japanese Society for Artificial Intelligence, Foundations of Ai Special Interest Group Workshop on Inductive Logic Programming.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,254,911)

6 months
4 (#792,011)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Logical settings for concept-learning.Luc De Raedt - 1997 - Artificial Intelligence 95 (1):187-201.
Pac-learning non-recursive prolog clauses.William W. Cohen - 1995 - Artificial Intelligence 79 (1):1-38.
First-order jk-clausal theories are PAC-learnable.Luc De Raedt & Sašo Džeroski - 1994 - Artificial Intelligence 70 (1-2):375-392.

Add more references