arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.4813cs.AI
收藏

一些句法合并算子合理性的探讨(扩展版)

Exploring the rationality of some syntactic merging operators (extended version)

Universidad de Los Andes(洛斯安第斯大学)

José Luis Chacón, Ramón Pino Pérez

摘要:

大多数合并算子都是用语义方法定义的,这些方法具有很高的计算复杂性。为了具有较低的计算复杂性,已经提出了一些以语法方式定义的合并运算符。在这项工作中,我们定义了一些语法合并运算符,并探讨其合理性性质。为了做到这一点,我们约束的信念基础是非常接近逻辑程序的公式集和底层的逻辑是通过前向链接规则(前向推理)定义。我们提出了两种类型的运营商:仲裁运营商的输入只有两个基地和融合的完整性约束运营商。本文从Liberatore和Shaerf提出的LS公设出发,引入了一组公设,并通过这些公设对第一类算子进行了分析。我们还引入了一组由Konieczny和Pino Pérez提出的KP公设启发的公设,并通过这些公设分析了第二类算子。

英文摘要:

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érez and then we analyzed the second class of operators through these postulates.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑