Hypothesis finding based on upward refinement of residue hypotheses
Hypothesis finding based on upward refinement of residue hypotheses
复制标题
DOI：
10.1016/s0304-3975(02)00416-4
复制
发表时间：
2003-04
期刊：
影响因子：
--
通讯作者：
Akihiro Yamamoto
中科院分区：
文献类型：
--
作者：
Akihiro Yamamoto
对于给定的逻辑公式B和E，使得B ≠ E，假设发现意味着生成公式H，使得B ≠ H ≠ E。假设发现是归纳推理和知识发现等推理领域的基本技术。为了把以前提出的各种假设发现方法放在一个一般的基础上，我们使用向上精化和残差假设。我们表明，他们的组合是一个完整的方法来解决任何假设发现问题的子句逻辑。我们扩展了相对包容关系，并表明以前提出的一些假设发现方法可以被视为发现假设，相对于一个给定的背景理论submersed的例子。注意到弱化规则可能会使假设发现难以解决，我们建议将此规则限制为逆分辨率或包容。我们还注意到，这项工作与相关逻辑有关。
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. 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.