Learning from good and bad data
Learning from good and bad data
Learning elementary formal systems
Theoretical Computer Science
Linear resolution for consequence finding
Artificial Intelligence
The resolution calculus
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
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Minimised Residue Hypotheses in Relevant Logic
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Which Hypotheses Can Be Found with Inverse Entailment?
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Induction as Consequence Finding
Machine Learning
Towards a logical reconstruction of CF-induction
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Mode-directed inverse entailment for full clausal theories
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Comparison of upward and downward generalizations in CF-Induction
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
| Hi-index | 0.00 |
For given logical formulae B and E such that B n E, hypothesis finding means the generation of a formula H such that B ∧ H ⊧ E. Hypothesis finding constitutes a basic technique for fields of inference, like inductive inference and knowledge discovery. In order to put various hypothesis finding methods proposed previously on one general ground, we use upward refinement and residue hypotheses. We show that their combination is a complete method for solving any hypothesis finding problem in clausal logic. We extend the relative subsumption relation, and show that some hypothesis finding methods previously presented can be regarded as finding hypotheses which subsume examples relative to a given background theory. Noting that the weakening rule may make hypothesis finding difficult to solve, we propose restricting this rule either to the inverse of resolution or to that of subsumption. We also note that this work is related to relevant logic.