A logical framework for default reasoning
Artificial Intelligence
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
Learning Acyclic First-Order Horn Sentences from Entailment
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Logical Aspects of Several Bottom-Up Fittings
ALT '98 Proceedings of the 9th 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
Minimised Residue Hypotheses in Relevant Logic
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Theory of Hypothesis Finding in Clausal Logic
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Induction, Abduction, and Consequence-Finding
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Induction on Failure: Learning Connected Horn Theories
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
DNF hypotheses in explanatory 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 ≠ 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. It can also be considered a special case of abduction. In this paper we define a hypothesis finding method which is a combination of residue hypotheses and anti-subsumption. Residue hypotheses have been proposed on the basis of the terminology of the Connection Method, while in this paper we define it in the terminology of resolution. We show that hypothesis finding methods previously proposed on the bases of resolution are embedded into our new method. We also point out that computing residue hypotheses becomes a lot more efficient under the restrictions required by the previous methods to be imposed on hypotheses, but that these methods miss some hypotheses which our method can find. Finally, we show that our method constitutes an extension of Plotkin's relative subsumption.