理论修补的可追溯性
Tractability of Theory Patching
摘要:
在本文中,我们考虑的问题“理论补丁”,在其中我们给出了一个域理论,其组件中的一些表示可能是有缺陷的,和一组标记的领域概念的训练样本。理论修补问题是仅修改理论的指示成分,使得所得理论正确地分类所有训练样本。因此,理论修补是一种理论修订,其中对理论的各个组成部分进行修订。我们关心的是在本文中,以确定哪些类的逻辑域理论的理论修补问题是易处理的。我们考虑了命题和一阶域理论,并表明理论修补问题等效于确定理论中包含的哪些信息是“稳定的”,无论可能对理论进行什么修改。我们表明,确定稳定性是易于处理的,如果输入理论满足两个条件:每个理论组件的修订有单调的影响分类的例子,和理论组件独立地作用在分类的例子在理论。我们还展示了如何引入的概念可以用来确定特定的理论修补算法的合理性和完整性。
英文摘要:
In this paper we consider the problem of `theory patching', in which we are given a domain theory, some of whose components are indicated to be possibly flawed, and a set of labeled training examples for the domain concept. The theory patching problem is to revise only the indicated components of the theory, such that the resulting theory correctly classifies all the training examples. Theory patching is thus a type of theory revision in which revisions are made to individual components of the theory. Our concern in this paper is to determine for which classes of logical domain theories the theory patching problem is tractable. We consider both propositional and first-order domain theories, and show that the theory patching problem is equivalent to that of determining what information contained in a theory is `stable' regardless of what revisions might be performed to the theory. We show that determining stability is tractable if the input theory satisfies two conditions: that revisions to each theory component have monotonic effects on the classification of examples, and that theory components act independently in the classification of examples in the theory. We also show how the concepts introduced can be used to determine the soundness and completeness of particular theory patching algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。