Lost in translation: Language independence in propositional logic - application to belief change
Lost in translation: Language independence in propositional logic - application to belief change
复制标题
迷失在翻译中：命题逻辑中的语言独立性——应用于信仰改变
DOI：
10.1016/j.artint.2013.09.005
复制
发表时间：
2014
影响因子：
14.4
通讯作者：
Nicolas Schwind
中科院分区：
文献类型：
--
作者：
P. Marquis;Nicolas Schwind
虽然命题逻辑被广泛用作许多人工智能应用的表示框架，但到目前为止，命题环境中的语言独立性概念还没有得到太多关注。本文将命题算子的语言无关性定义为健壮性。符号翻译。我们激发了关注受限类型符号翻译的需要，介绍和研究了几类感兴趣的翻译，并提供了一些表征结果。我们还确定了从这些家族中识别符号翻译的计算复杂性。然后研究了信念合并、信念修正和信念更新算子的稳健性。不同类型的翻译。事实证明，一些合理的合并/修订/更新操作符不能保证提供最基本的(但不是微不足道的)形式的语言独立性。
While propositional logic is widely used as a representation framework for many AI applications, the concept of language independence in the propositional setting has not received much attention so far. In this paper, we define language independence for a propositional operator as robustness w.r.t. symbol translation. We motivate the need to focus on symbol translations of restricted types, introduce and study several families of translations of interest, and provide a number of characterization results. We also identify the computational complexity of recognizing symbol translations from those families. Then we investigate the robustness of belief merging, belief revision and belief update operators w.r.t. translations of different types. It turns out that some rational merging/revision/update operators are not guaranteed to offer the most basic (yet non-trivial) form of language independence.