On the Semantics of Arbitration

On the Semantics of Arbitration
复制标题

DOI:
10.1142/s0218196797000095
复制
发表时间:
1997-04
期刊:
Int. J. Algebra Comput.
影响因子:
--
通讯作者:
P. Revesz
P. Revesz
中科院分区:
其他
文献类型:
--
作者:
P. Revesz

文献摘要

被引文献

相似文献

修订和更新操作符将新信息添加到由逻辑理论表示的一些旧信息中。Katsuno和Mendelzon表明,修订和更新操作符都可以被描述为在旧信息中完成最小的更改以适应新信息。仲裁算子将两个或多个加权信息加在一起,其中权重指示信息的相对重要性,而不是严格的优先级。本文表明,仲裁运营商也可以被描述为完成一个最小的变化。文中还定义了模型拟合算子,并对模型拟合算子进行了分析。
Revision and update operators add new information to some old information represented by a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized as accomplishing a minimal change in the old information to accommodate the new information. Arbitration operators add two or more weighted informations together where the weights indicate the relative importance of the informations rather than a strict priority. This paper shows that arbitration operators can be also characterized as accomplishing a minimal change. The operator of model-fitting is also defined and analyzed in the paper.