Fuzzy cardinality and the modeling of imprecise quantification

The concept of cardinality of a fuzzy set has received attention from several researchers and has been defined in several apparently independent manners. A systematic investigation of this notion is performed which unifies and improves previous attempts. The cardinality of a fuzzy set, viewed as a fuzzy integer, is related to scalar cardinality indices. The closely related question of the probability of a fuzzy event is dealt with. Lastly, the usefulness of fuzzy cardinality for meaning representation of statements or queries involving fuzzy linguistic quantifiers is emphasized.     

基础模糊命题演算系统BL~*的改进系统

基础模糊命题演算系统BL*是一个和基础命题演算系统BL相对独立的命题演算系统。命题演算系统L*是系统BL*的扩张,但不是系统BL的扩张。通过对系统BL*及其它模糊命题演算系统的研究,本文对BL*系统进行了修正,进一步改进了BL*系统中的公理体系。     

二值命题逻辑中有限理论带误差结论集的结构

二值命题逻辑系统中理论Г的带误差结论集是近似推理研究的基本对象,对其结构进行分析是近似推理研究中需要解决的问题。通过公式是有限理论Г的带误差结论的充要条件,利用集合划分方法,对有限理论Г的带误差结论集分别基于真度相等关系和逻辑等价关系进行分类,得到了基于两类等价关系的包含等价类个数和代表元表示形式的分类定理,进一步体现了二值命题逻辑系统近似推理研究中理论Г的带误差结论集的特征。     

Revising the OWA operator for multi criteria decision making problems under uncertainty

Multi criteria decision making (MCDM) problems are usually under uncertainty. One of these uncertain parameters is the decision maker (DM)’s degree of optimism, which has an important effect on the results. Fuzzy linguistic quantifiers are used to obtain the assessments of this parameter from DM and then, because of its uncertainty it is assumed to have stochastic nature. A new approach, entitled FSROWA, is introduced to combine the Fuzzy and Stochastic features into a Revised OWA operator.     

二值命题逻辑中基于前提信息的近似推理理论

以真度为基础,给出二值命题逻辑系统中基于前提信息的相似度和伪距离的概念以及伪距离的真度表示式,对二值命题逻辑中具有前提信息的近似推理问题进行讨论.     

不完全三值逻辑在语言表达上的相互比较

深入讨论各种命题联结词含量不完全的三值逻辑的语言表达的能力,完全弄明白了三值系统L3,L3,B3,B3,K3,K3,MP的语言表达能力的等效或不等效关系,特别应当指出的一个结论是：中介命题逻辑MP作为一种命题联结词含量不完全的三值系统而言,它和其他命题联结含量不完全的三值逻辑L3,L3Δ,B3,B3Δ,K3,K3Δ的语言表达能力都不等效,从而也由此体现出MP的一种自身特色。     

Simple characterization of functionally complete one‐element sets of propositional connectives

A set of propositional connectives is said to be functionally complete if all propositional formulae can be expressed using only connectives from that set. In this paper we give sufficient and necessary conditions for a one‐element set of propositional connectives to be functionally complete. These conditions provide a simple and elegant characterization of functionally complete one‐element sets of propositional connectives (of arbitrary arity). (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)