(Enter summary)
Abstract: Recently there has been increasing interest in systems which induce first order logic programs from examples. However, many difficulties need to be overcome. Well-known algorithms fail to discover correct logical descriptions for large classes of interesting predicates, due either to the intractability of search or overly strong limitations applied to the hypothesis space. In contrast, search is avoided within Plotkin's framework of relative least general generalisation (rlgg). It is replaced... (Update)
Cited by: More
A Polynomial Approach to the - Constructive Induction Of
(Correct)
CrossMine: Efficient Classification Across Multiple Database .. - Xiaoxin Yin Uiuc (2004)
(Correct)
Learning First-Order Definitions of Functions - Quinlan University Of (1996)
(Correct)
Active bibliography (related documents): More All
0.1: Inductive Logic Programming - Muggleton (1992)
(Correct)
0.1: A Strategy for Constructing New Predicates in First Order Logic - Muggleton (1988)
(Correct)
0.1: The use of Background Knowledge in Inductive Logic Programming - Camacho (1994)
(Correct)
Similar documents based on text: More All
0.4: Metric-Based Inductive Learning Using Semantic Height Functions - Markov, Marinchev (2000)
(Correct)
0.1: Incorporating Linguistics Constraints into Inductive Logic.. - Cussens, Pulman (2000)
(Correct)
0.1: Prolog, Refinements and RLGG's - Claude Sammut
(Correct)
Related documents from co-citation: More All
61: Learning Logical Definitions from Relations (context) - Quinlan - 1990
41: Inductive Logic Programming
- Muggleton - 1992
29: Machine invention of first-order predicates by inverting resolution (context) - Muggleton, Buntine - 1988
BibTeX entry: (Update)
S. Muggleton and C. Feng. Efficient induction of logic programs. In Proceedings of the 1st conference on algorithmic learning theory, pages 368--381. Ohmsma, Tokyo, Japan, 1990. http://citeseer.ist.psu.edu/muggleton90efficient.html More
@inproceedings{ muggleton90efficient,
author = "Muggleton, S. and Feng, C.",
title = "Efficient induction of logic programs",
booktitle = "Proceedings of the 1st Conference on Algorithmic Learning Theory",
publisher = "Ohmsma, Tokyo, Japan",
pages = "368-381",
year = "1990",
url = "citeseer.ist.psu.edu/muggleton90efficient.html" }
Citations (may not include all citations):
493
Communications of the ACM (context) - Valiant, of et al. - 1984
492
Learning logical definitions from relations (context) - Quinlan - 1990
388
Inductive logic programming
- Muggleton - 1991
328
Algorithmic program debugging (context) - Shapiro - 1983
154
Machine invention of first-order predicates by inverting res.. (context) - Muggleton, Buntine - 1988
113
Towards a mathematical theory of inductive inference (context) - Blum, Blum - 1975
83
Generating production rules from decision trees (context) - Quinlan - 1987
69
A further note on inductive generalization (context) - Plotkin - 1971
63
Learning concepts by asking questions (context) - Sammut, Banerji - 1986
55
Automatic Methods of Inductive Inference (context) - Plotkin - 1971
28
Machine Learning (context) - Clark, Niblett et al. - 1989
16
Generalised subsumption and its applications to induction an.. (context) - Buntine - 1988
16
Discovering rules from large collections of examples: a case.. (context) - Quinlan - 1979
1
Learning by Experimentation (context) - Feng - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.york.ac.uk/~stephen/cnf.html): More
Application of Inductive Logic Programming to.. - Turcotte, Muggleton, ..
(Correct)
Duce, an Oracle Based Approach to Constructive Induction - Muggleton (1987)
(Correct)
Inductive Logic Programming: issues, results and the LLL challenge - Muggleton
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC