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

关于可能性不确定性和模糊性逻辑PLFC的语义和自动演绎

On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness

Universitat de Lleida (UdL)(莱里达大学)

Teresa Alsinet, Lluis Godo, Sandra Sandri

摘要:

可能性逻辑是一种著名的不确定性分级逻辑,适合在不完全信息和部分不一致知识的情况下进行推理,它建立在经典一阶逻辑的基础上。可能性逻辑有一个基于反驳完全归结式演算的证明过程。最近,一个语法扩展的一阶可能性逻辑(称为PLFC)处理模糊常数和模糊限制量词已被提出。我们的目标是目前的步骤,对形式化的PLFC本身和自动演绎系统,它(一)提供了一个正式的语义;(二)定义一个健全的决议式演算反驳;和(三)描述一阶证明程序PLFC条款的基础上(二)和一个新的概念,最一般的替代两个文字在决议步骤。与标准的可能性逻辑语义相反,模糊常数公式的真值评估是多值的,而不是布尔值的,因此也需要一个扩展的可能性不确定性概念。

英文摘要:

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a proof procedure based on a refutation complete resolution-style calculus. Recently, a syntactical extension of first order Possibilistic logic (called PLFC) dealing with fuzzy constants and fuzzily restricted quantifiers has been proposed. Our aim is to present steps towards both the formalization of PLFC itself and an automated deduction system for it by (i) providing a formal semantics; (ii) defining a sound resolution-style calculus by refutation; and (iii) describing a first-order proof procedure for PLFC clauses based on (ii) and on a novel notion of most general substitution of two literals in a resolution step. In contrast to standard Possibilistic logic semantics, truth-evaluation of formulas with fuzzy constants are many-valued instead of boolean, and consequently an extended notion of possibilistic uncertainty is also needed.

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

↑