Research on Advanced Systems of Efficient Hypothesis Finding

在这项研究中，我们开发了新的先进的假设发现方法，并实现了基于结果发现技术的高效假设发现系统。所提出的太阳系统和CF诱导系统分别计算了溯因假说和归纳假说。研究成果可概括为以下三个方面。高级假设发现的基本理论(岩间、井上、Nabeshima)。我们发展了关于溯因理论的等价性、缺省理论和逻辑程序的一般性以及动作描述中因果规律的归纳的理论结果。我们还研究了解释性归纳和描述性归纳的一个新的综合框架--限制归纳的某些方面，并提出了一种新的一阶近似方法，称为逐点限制归纳，它使我们能够通过普通的结果发现演算推导出一些有趣的假设。开发一种高效的结果发现系统(Nabeshi…证明了任何SOL/连接表的大小保持倒置变换都可以通过折叠操作来实现，并给出了增量公理递增环境下的大小最优结果寻找演算。我们还发展了一种非稳定生产场的结果发现方法，并将其应用于从全子句理论中完成推导。我们进一步实现了一个新版本的后果发现系统Solar，它使用了各种最先进的剪枝技术。研究了SOLAR框架下对公理的等价处理，并首次实现了一个C版本的SOLAR原型系统。基于CF-归纳的假设发现及其应用(Inoue)。CF-归纳是一个完善和完整的归纳逻辑程序设计系统，用于从全从句理论计算假设。CF-归纳由几个不确定的过程组成，特别是它的推广过程被假设为归纳算子的任意完全组合。因此，我们提出了一种方法，通过保持CF-归纳的可靠性和完备性来减少泛化算子的可能组合。接下来，我们将CF诱导应用于代谢途径中可能的酶反应状态的估计。在这项工作中，我们证明了CF诱导不仅可以计算酶反应的可能状态，还可以计算当前背景理论中缺失的因果关系。较少

In this research, we developed new advanced methods for hypothesis finding and implemented efficient hypothesis-finding systems based on consequence-finding techniques. The proposed systems, SOLAR and CF-induction, compute abductive and inductive hypotheses, respectively. Research results can be summarized as the following three items.1. Basic theories for advanced hypothesis-finding (Iwanuma, Inoue, Nabeshima).We developed theoretical results on equivalence of abductive theories, generality of default theories and logic programs, and induction of causal laws in action descriptions. We also studied some aspects of circumscriptive induction, which is a new integrated framework of explanatory induction and descriptive induction, and proposed a new first-order approximation method, called pointwise circumscriptive induction, which enables us to derive some interesting hypotheses by the ordinary consequence finding calculus.2. Development of an efficient consequence-finding system (Nabeshi … More ma, Iwanuma, Inoue).We showed that a size-preserving upside-down transformation of any SOL/Connection tableau can be achieved by the folding-up operation, and gave a size-optimal consequence finding calculus for an incrementally axiom-increasing environment. We also developed a consequence-finding method with non-stable production fields and applied it to complete abduction from full clausal theories. We further implemented a new version of the consequence-finding system SOLAR with various state-of-the-art pruning techniques. Handling axioms with equality is also investigated in the SOLAR framework, and a prototype system of a C++ version of SOLAR is firstly realized.3. Hypothesis-finding by CF-induction and its application (Inoue).CF-induction is a sound and complete inductive logic programming system to compute hypotheses from full-clausal theories.CF-induction consists of several nondeterministic procedures, and in particular its generalization procedure is assumed to be any complete combination of inductive operators. We thus proposed a method to reduce possible combinations of generalization operators by preserving the soundness and completeness of CF-induction. Next, we applied CF-induction to estimation of possible enzymatic reaction states in metabolic pathways. In this work, we showed that CF-induction can compute not only possible states of enzymatic reactions but also causal relations that are missing in the current background theory. Less