Corpus ID: 14992676

Efficient Induction of Logic Programs

  title={Efficient Induction of Logic Programs},
  author={Stephen Muggleton and Cao Feng},
Recently there has been increasing interest in systems which induce rst order logic programs from examples. However, many diiculties 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 by… Expand
ProGolem: A System Based on Relative Minimal Generalisation
It is shown that with Asymmetric Relative Minimal Generalisations (or ARMGs) relative to a bottom clause, clause length is bounded by the length of the initial bottom clause and therefore do not need the determinacy restrictions used in Golem. Expand
The learnability of description logics with equality constraints
The learnable sublanguage of the restricted first-order logics known as “description logics” appears to be incomparable in expressive power to any subset of first- order logic previously known to be learnable. Expand
Pac-Learning Non-Recursive Prolog Clauses
It is demonstrated that a number of syntactic generalizations of this language are hard to learn, but that the language can be generalized to clauses of constant locality while still allowing pac-learnability. Expand
Pac-Learning a Restricted Class of Recursive Logic Programs
A program is described called FORCE2 that uses the new technique of "forced simulation" to learn twoclause "closed" linear recursive ij-determinate programs; although this class of programs is fairly restricted, it does include most of the standard benchmark problems. Expand
Some Lower Bounds for the Computational Complexity of Inductive Logic Programming
  • J. Kietz
  • Mathematics, Computer Science
  • ECML
  • 1993
It is shown that a learning algorithm for i2-determinate Hornclauses (with variable i) could be used to decide the PSPACE-complete problem of Finite State Automata Intersection, and that a Learning Algorithm for 12-nondeterminates HornclAuses could be use to decision the NP-complete Problem of Boolean Clause Satisfiability (SAT). Expand
The Difficulties of Learning Logic Programs with Cut
The analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages. Expand
An Efficient Subsumption Algorithm for Inductive Logic Programming
This paper adapts the notion of determinate clauses used in ILP and shows that θ-subsumption is decidable in polynomial time if D is determinate with respect to C, and outlines how theθ-reduction algorithm, an essential part of every lgg ILP-learning algorithm, can be improved by these ideas. Expand
Pairwise saturations in inductive logic programming
This work explores the possibility of reducing the induction running times of systems that use asymmetric relative minimal generalisation (ARMG) by analysing the bottom clauses of examples that serve as inputs into the generalisation operator by identifying literals that cannot appear in the ARMG. Expand
Compile the Hypothesis Space: Do it Once, Use it Often
This paper proposes a novel technique that avoids the procedure of deducing each example to evaluate each constructed clause, and presents an extension of the algorithm where each prefix-tree is computed only once (compiled) per example. Expand
Learnability of Description Logic Programs ( Extended Technical Report )
Carin-ALN is an interesting new rule learning bias for ILP. By allowing description logic terms as predicates of literals in datalog rules, it extends the normal bias used in ILP as it allows the useExpand


Machine Invention of First Order Predicates by Inverting Resolution
A mechanism for automatically inventing and generalising first-order Horn clause predicates is presented and implemented in a system called CIGOL, which uses incremental induction to augment incomplete clausal theories. Expand
Algorithmic Program Debugging
An algorithm that can fix a bug that has been identified, and integrate it with the diagnosis algorithms to form an interactive debugging system that can debug programs that are too complex for the Model Inference System to synthesize. Expand
Generalized Subsumption and Its Applications to Induction and Redundancy
Abstract A theoretical framework and algorithms are presented that provide a basis for the study of induction of definite (Horn) clauses. These hinge on a natural extension of θ-subsumption thatExpand
A theory of the learnable
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint. Expand
Toward a Mathematical Theory of Inductive Inference
This paper investigates the theoretical capabilities and limitations of a computer to infer such sequences and design Turing machines that in principle are extremely powerful for this purpose and place upper bounds on the capabilities of machines that would do better. Expand
Generating Production Rules from Decision Trees
This paper describes a technique for transforming such trees to small sets of production rules, a common formalism for expressing knowledge in expert systems, and provides a way of combining different decision trees for the same classification domain. Expand
Learning logical deenitions from relations
  • Machine Learning
  • 1990
Learning by Experimentation in a Robot World
The CN2 algorithm
  • Machine Learning
  • 1989
Discovering rules from large collections of examples: a case study
  • Expert Systems in the Micro-electronic Age
  • 1979