Fuzzy ontology representation using OWL 2

The need to deal with vague information in Semantic Web languages is rising in importance and, thus, calls for a standard way to represent such information. We may address this issue by either extending current Semantic Web languages to cope with vagueness, or by providing a procedure to represent such information within current standard languages and tools. In this work, we follow the latter approach, by identifying the syntactic differences that a fuzzy ontology language has to cope with, and by proposing a concrete methodology to represent fuzzy ontologies using OWL 2 annotation properties. We also report on some prototypical implementations: a plug-in to edit fuzzy ontologies using OWL 2 annotations and some parsers that translate fuzzy ontologies represented using our methodology into the languages supported by some reasoners.     

Fuzzy Horn logic II

The paper studies closure properties of classes of fuzzy structures defined by fuzzy implicational theories, i.e. theories whose formulas are implications between fuzzy identities. We present generalizations of results from the bivalent case. Namely, we characterize model classes of general implicational theories, finitary implicational theories, and Horn theories by means of closedness under suitable algebraic constructions.     

Fuzzy logics based on [0,1)-continuous uninorms

Axiomatizations are presented for fuzzy logics characterized by uninorms continuous on the half-open real unit interval [0,1), generalizing the continuous t-norm based approach of Hájek. Basic uninorm logic BUL is defined and completeness is established with respect to algebras with lattice reduct [0,1] whose monoid operations are uninorms continuous on [0,1). Several extensions of BUL are also introduced. In particular, Cross ratio logic CRL, is shown to be complete with respect to one special uninorm. A Gentzen-style hypersequent calculus is provided for CRL and used to establish co-NP completeness results for these logics. Research supported by Marie Curie Fellowship Grant HPMF-CT-2004-501043.     

Fuzzy logics with modalities

We explore the basic fuzzy logic BL as well as propositional fuzzy logics with modalities □ and ◊ and a total accessibility relation. Formulations and proofs are given to replacement theorems for BL. A basic calculus of modal fuzzy logic is introduced. For this calculus and its extensions, we prove replacement and deduction theorems. Supported by RFBR grant No. 06-01-00358, by INTAS grant No. 04-77-7080, and by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-4787.2006.1. __________ Translated from Algebra i Logika, Vol. 45, No. 6, pp. 731–757, November–December, 2006.     

一种新的三角模糊数算子在加权模糊推理中的应用

针对基于模糊逻辑的加权模糊推理,Chen Shy i-M ing提出了两种计算合取式前件整体真值的方法。由于所用模糊数算子的影响,两种方法的求取结果在准确性和合理性上都存在一定的缺陷。这种缺陷将直接影响推理的性能。因此,为改善这种缺陷,提高推理性能,本文提出了一种新的三角模糊数算子。它的应用可以提高推理的准确性和合理性。     

模糊概念格与模糊推理

基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。     

正则剩余格上的模糊理想及模糊蕴涵理想

对正则剩余格的结构作进一步研究。利用正则剩余格上、算子并结合模糊数学的思想和方法,在正则剩余格上引入了模糊理想和模糊蕴涵理想的概念,讨论了它们的基本性质。主要结果是:(1)给出了模糊理想和模糊蕴涵理想的等价刻画;(2)证明了模糊蕴涵理想一定是模糊理想,模糊理想不必是模糊蕴涵理想;(3)证明了全体模糊理想之集在给定的运算下是一个完备的分配格。     

模糊BIK+-逻辑与非可换模糊逻辑

为了建立各种可换和非可换模糊逻辑的公共基础(蕴涵片段),提出了一个新的蕴涵逻辑,称为模糊BIK+-逻辑。证明了这一新的蕴涵逻辑的可靠性和弱完备性定理,同时讨论了模糊BIK+-逻辑与各种模糊逻辑之间的关系,以及与它们配套的代数结构之间的关系。     

模糊半群上的模糊同余及其扩张

给出模糊半群上的模糊同余的概念,并进一步研究它的一些基本代数性质。同时研究带有模糊半群上的模糊同余扩张性质(FCEPF)的半群类,得到一个半群有模糊半群上的模糊同余扩张性质、有模糊同余扩张性质(FCEP)、有同余扩张性质(CEP)三个条件是等价的。     

BIK+-逻辑与非可换模糊逻辑

引入BIK -逻辑的概念,证明了BIK -逻辑的可靠性定理(基于BCC-代数)。同时,研究了BIK -逻辑与非可换模糊逻辑的关系,说明了各种源于模糊逻辑的代数结构之间的内在联系,并用一个图示表达了这些关系。     

Bi-matrix Games with Fuzzy Goals and Fuzzy

A bi-matrix game with fuzzy goal is shown to be equivalent to a (crisp) non-linear programming problem in which the objective as well as all constraint functions are linear except two constraint functions, which are quadratic. This equivalence is further extended to bi-matrix games with fuzzy pay-offs, as well as to bi-matrix games with fuzzy goals and fuzzy payoffs, whose equilibrium strategies are conceptualized by employing a suitable ranking (defuzzification) function.     

模糊错误逻辑分解转化词与内涵否定词的逻辑关系

在文 [1]的基础上 ,在简单分析现时中错误的传递与转化的实际存在的同时 ,介绍国内外在逻辑研究领域对事物传递与转化规律的研究现状。特别为了探索控制与防范证券风险的技术而主要研究模糊错误逻辑分解转化词与内涵否定词的逻辑关系。     

A normal form which preserves tautologies and contradictions in a class of fuzzy logics

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based on refutation methods.De Morgan implicative systems are triples like the De Morgan systems, which consider fuzzy implications instead of t-conorms. These systems can be used to evaluate the formulas of a propositional language based on the logical connectives of negation, conjunction and implication. Therefore, they determine different fuzzy logics, called implicative De Morgan fuzzy logics.In this paper, we will introduce a normal form for implicative De Morgan systems and we will show that for implicative De Morgan fuzzy logics whose t-norms are strict, this normal form preserves contradictions as well as tautologies.     

区间值模糊命题逻辑的最大子代数及其广义重言式

将S-型蕴涵算子改为R0-蕴涵算子，从而找到区间值模糊逻辑I[0，1]的一个最大子代数IQ，进而将王国俊教授在逻辑系统W中的广义重言式理论推广应用到IQ中。     

再扩充模糊逻辑中逻辑程序的模型论语义和不动点语义研究

模糊逻辑及其扩充是处理不确定性与模糊性信息的重要数学工具,在近似推理、人工智能等领域有着广泛的应用。而逻辑程序也已经成为人工智能的研究热点之一。本文是在再扩充模糊逻辑中,对逻辑程序进行了语义的研究。给出了其语法和语义描述,并且将逻辑程序的许多主要结论推广到再扩充模糊逻辑中。首先,得到了关于模糊逻辑推论的充分必要条件以及模型交与强模型交性质。然后,通过引入一个H erbrand解释算子Pτ:LBp→LBp,给出了确定性程序P的H erbrand模型的充分条件和强H erbrand模型的充分必要条件。最后,建立了确定性程序的最小强H erbrand模型的不动点刻画定理。     

三级倒立摆的T-S型前馈补偿模糊神经网络控制

为解决T akag i-Sugeno型模糊神经网络在控制多变量系统时的规则组合爆炸问题,提出一种误差前馈补偿的模糊神经网络控制方案,有效实现了三级倒立摆的稳定控制。该控制方案适用对状态变量可按性质和重要程度划分的多变量系统的控制,大大减少了模糊神经网络控制器的规则数,有利于利用专家的控制经验,具有良好的鲁棒性和非线性适应能力。