Iterated Theory Base Change: A Computational Model
Iterated Theory Base Change: A Computational Model
复制标题
迭代理论基础变化：计算模型
DOI：
--
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
Mary
中科院分区：
文献类型：
--
作者：
Mary
从实践的角度来看，AGM范式是一种理想和合理的信息变化的正式方法，它存在两个缺点，第一个是关于信息的有限表示的困难，第二个是缺乏对变化算子迭代的支持。在本文中，我们证明了在AGM范式下，这些实际问题可以以理论上令人满意的方式得到整体解决。
我们引入了部分壕沟排名，作为理论基础和良好排序的episterruc壕沟的典范表示，并提供了一个计算模型，当它们接收到新的信息时，使用基于最小变化原则的过程来调整部分壕沟排名。
本文发展的标准AGM理论变化算子和理论基础变化算子之间的联系表明，所提出的迭代理论基础变化的计算模型表现出理想的行为。
The AGM paradigm is a formal approach to ideal and rational information change From a practical perspective it suffers from two shortcomings, the first involves difficulties with respect to the finite representation of information, and the second involves the lack of support for the iteration of change operators. In this paper we show that these practical problems can be solved in theoretically satisfying ways wholely with in the AGM paradigm.
We introduce a partial entrenchment ranking which serves as a canonical representation for a theory base and a well-ranked episterruc entrenchment, and we provide a computational model for adjusting partial entrenchment rankings when they receive new information using a procedure based on the principle of minimal change.
The connection between the standard AGM theory change operators and the theory base change operators developed herein suggest that the proposed computational model for iterated theory base change exhibits desirable behaviour.