Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Linear resolution for consequence finding
Artificial Intelligence
Simply logical: intelligent reasoning by example
Simply logical: intelligent reasoning by example
An inference method for the complete inverse of relative subsumption
New Generation Computing - Special issue on inductive logic programming 97
Revising the logical foundations of inductive logic programming systems with ground reduced programs
New Generation Computing - Special issue on inductive logic programming 97
Which Hypotheses Can Be Found with Inverse Entailment?
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
A Theory of Hypothesis Finding in Clausal Logic
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Theory Completion Using Inverse Entailment
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
New Conditions for the Existence of Least Generalizations under Relative Subsumption
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
| Hi-index | 0.00 |
In this paper we propose a new ILP method Bottom Reduction. It is an extension of Bottom Generalization for treating multiple examples. Using Bottom Reduction we can find all hypotheses which subsume all of given examples relative to a background theory in Plotkin's sense. We do not assume any restriction on the head predicates of the examples. Applying Bottom Reduction to examples which have a predicate different from those of other examples, we can reduce the search space of hypotheses. We have already implemented a simple learning system named BORDA based on Bottom Reduction on a Prolog system, and we present, in this paper, some techniques in its implementation.