A Further Note on Inductive Generalization
A Further Note on Inductive Generalization
复制标题
关于归纳概括的进一步说明
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
G. Plotkin
中科院分区：
文献类型：
--
作者：
G. Plotkin
本文将Plotkin（1970）给出的求两个子句的最小推广的算法发展为归纳推广理论。可以形成的假设类型非常简单。它们都具有以下形式：（x）PX=：l Qx.我们遵循布坎南（Buchanan，1966）的科学哲学思想。没有人寻求产生真实假设的可靠方法。相反，我们定义（在一阶谓词演算方面）数据和数据证据的概念。接下来，我们建立了一些形式化的标准，证明一个句子是一个描述性的假设，这是对数据的一个很好的解释。然后，我们可以寻找这样的最佳假设。虽然这个问题在一般情况下是无法解决的，但可以区分出一些可解决的子情况。我们编写了其中一个程序，并尝试了一些例子。
In this paper, we develop the algorithm, given in Plotkin (1970), for finding the least generalization of two clauses, into a theory of inductive generalization.. The types of hypothesis which can be formed are very simple. They all have the form: (x)PX=:l Qx.. We have been guided by ideas from the philosophy of science, following Buchanan (1966). There is' no search for infallible methods of .generating true hypotheses. Instead we define (in terms of first-order predicate calculus) the notions of data and evidence for the data. Next, some formal criteria are set up for a sentence to be a descriptive hypothesis which is a goodexplanation of the data, given the evidence. We can then look for the best such hypothesis. Although this problem is insoluble in general, some soluble subcases can be distinguished. We programmed one of these and tried some examples.