一种基于修订的冲突信息解决方法

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

摘要翻译：
本文通过对析取最大调整(DMA)方法（Benferhat et al.2004)的推广，提出了一种基于修正的冲突解决方法。修正运算符可以分为两类：基于模型的修正运算符和基于公式的修正运算符。因此，基于修正的方法有两个不同的版本，根据这两个版本选择修正算子族。考虑了两种特殊的修正算子，一种是基于模型的Dalal修正算子，另一种是基于基数极大的修正算子，它是一种公式修正算子。当选择Dalal的修正算子时，基于修正的方法是独立于每个层的句法形式的，它捕捉到了一些最小变化的概念。当选择基于cardinalitymaximal的修正算子时，基于修正的方法与DMA方法等价。我们还表明，这两种方法都比DMA方法在计算上更容易。
---
英文标题：
《A Revision-Based Approach to Resolving Conflicting Information》
---
作者：
Guilin Qi, Weiru Liu, David A. Bell
---
最新提交年份：
2012
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  In this paper, we propose a revision-based approach for conflict resolution by generalizing the Disjunctive Maxi-Adjustment (DMA) approach (Benferhat et al. 2004). Revision operators can be classified into two different families: the model-based ones and the formula-based ones. So the revision-based approach has two different versions according to which family of revision operators is chosen. Two particular revision operators are considered, one is the Dalal's revision operator, which is a model-based revision operator, and the other is the cardinality-maximal based revision operator, which is a formulabased revision operator. When the Dalal's revision operator is chosen, the revision-based approach is independent of the syntactic form in each stratum and it captures some notion of minimal change. When the cardinalitymaximal based revision operator is chosen, the revision-based approach is equivalent to the DMA approach. We also show that both approaches are computationally easier than the DMA approach.
---
PDF链接：
https://arxiv.org/pdf/1207.1397

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：解决方法 Presentation Generalizing Intelligence Computation approach 提出 two 算子 based