摘要翻译：
大多数合并算子采用语义方法定义，计算复杂度很高。为了使算子具有较低的计算复杂度，提出了一些以句法方式定义的合并算子。本文定义了一些句法合并算子，并探讨了其合理性性质。为此，我们将信念基约束为非常接近逻辑程序的公式集，并通过前向链规则（Modus Ponens）定义底层逻辑。我们提出了两类算子：当输入只有两个基时的仲裁算子和带完整性约束的融合算子。我们在Liberatore和Shaerf提出的LS公设的启发下引入了一组公设，并通过这些公设分析了第一类算子。在Konieczny和Pino P\'erez提出的公设KP的启发下，我们引入了一组公设，并通过这些公设分析了第二类算子。
---
英文标题：
《Exploring the rationality of some syntactic merging operators (extended
  version)》
---
作者：
Jos\'e Luis Chac\'on and Ram\'on Pino P\'erez
---
最新提交年份：
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中的材料。
--

---
英文摘要：
  Most merging operators are defined by semantics methods which have very high computational complexity. In order to have operators with a lower computational complexity, some merging operators defined in a syntactical way have be proposed. In this work we define some syntactical merging operators and exploring its rationality properties. To do that we constrain the belief bases to be sets of formulas very close to logic programs and the underlying logic is defined through forward chaining rule (Modus Ponens). We propose two types of operators: arbitration operators when the inputs are only two bases and fusion with integrity constraints operators. We introduce a set of postulates inspired of postulates LS, proposed by Liberatore and Shaerf and then we analyzed the first class of operators through these postulates. We also introduce a set of postulates inspired of postulates KP, proposed by Konieczny and Pino P\'erez and then we analyzed the second class of operators through these postulates.
---
PDF链接：
https://arxiv.org/pdf/1207.4813