Hypotheses finding via residue hypotheses with the resolution principle

12Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For given logical formulae B and E such that (Formula presented), 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.

Cite

CITATION STYLE

APA

Yamamoto, A., & Fronhöfer, B. (2000). Hypotheses finding via residue hypotheses with the resolution principle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1968, pp. 156–165). Springer Verlag. https://doi.org/10.1007/3-540-40992-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free