非单调预不动点与学习
Non-monotonic Pre-fixed Points and Learning
摘要:
我们考虑了在任意知识空间上寻找交互式实现器的预不动点的问题,得到了一个相对递归的过程。知识空间和交互式实现器是表示学习过程的抽象设置,可以解释非构造性证明。知识空间中的原子信息被分层,并根据知识状态被评估为真值。然后,实现器用于定义通过添加和可能删除原子来扩展给定状态的操作符:在学习过程中,知识的状态非单调地变化。存在一个预先固定点的实现是相当于终止的学习过程与一些国家的知识是免费的专利矛盾,这样就没有什么可添加的。在本文中,我们推广我们以前的结果的情况下,2级知识空间和确定性运营商的情况下,欧米茄级知识空间和非确定性运营商。
英文摘要:
We consider the problem of finding pre-fixed points of interactive realizers over arbitrary knowledge spaces, obtaining a relative recursive procedure. Knowledge spaces and interactive realizers are an abstract setting to represent learning processes, that can interpret non-constructive proofs. Atomic pieces of information of a knowledge space are stratified into levels, and evaluated into truth values depending on knowledge states. Realizers are then used to define operators that extend a given state by adding and possibly removing atoms: in a learning process states of knowledge change nonmonotonically. Existence of a pre-fixed point of a realizer is equivalent to the termination of the learning process with some state of knowledge which is free of patent contradictions and such that there is nothing to add. In this paper we generalize our previous results in the case of level 2 knowledge spaces and deterministic operators to the case of omega-level knowledge spaces and of non-deterministic operators.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。