基于Lukasiewicz蕴涵算子的反向三I算法

三Ⅰ算法是针对模糊推理的FMP与FMT模型的一种新的推理方法。本文针对Lukasiewicz蕴涵算子讨论FMP模型及FMT模型的反向三Ⅰ推理及反向α-三Ⅰ推理,借助该蕴涵算子的性质,给出相应的推理算法。     

一些模糊推理方法的还原性

给出15个常用模糊蕴涵算子的三Ⅰ算法,在此基础上讨论由这15个蕴涵算子与CRI算法和三Ⅰ算法相结合生成的30种模糊推理方法的还原性。     

格值命题逻辑系统中基于滤子的MP归结演绎

给出了格值命题逻辑系统中子句的极简规则型范式,定义了MP归结.结合格蕴涵代数中滤子的性质,对格值命题逻辑系统中基于滤予的MP归结演绎及其语义与语法性质进行了研究,证明了归结演绎的可靠性与完备性定理.为进一步研究格值逻辑的自动归结推理奠定了理论基础.     

Topological representation for monadic implication algebras

In this paper, every monadic implication algebra is represented as a union of a unique family of monadic filters of a suitable monadic Boolean algebra. Inspired by this representation, we introduce the notion of a monadic implication space, we give a topological representation for monadic implication algebras and we prove a dual equivalence between the category of monadic implication algebras and the category of monadic implication spaces.      

格蕴涵代数的左幂等元

为了研究命题真值取于格上的逻辑系统,文献[1]给出了格蕴涵供数的概念,文献[2-6]给出了格蕴涵代数的滤子,同态和性质（P）的概念,并讨论了它们的一些性质。本文在格蕴函代数中引入左幂等元的概念,讨论格蕴函代数中左幂等元的性质及由全体左幂等元所构成集合的代数结构,得到格蕴涵代数的分解定理：格蕴涵代数可以分解为由左幂等元构成左映射的像集合与对偶核的直和。     

积格上蕴涵算子的直积分解

进一步讨论蕴涵算子的直积分解,描述积格上可以分解为两个蕴涵算子直积的蕴涵算子的特性,并研究积格上S-蕴涵、R-蕴涵、n-反演R-蕴涵和n-反演QL-蕴涵的可分解性。     

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 Horn logic I

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style completeness theorem (degree of provability equals degree of truth) from which we get some particular cases by imposing restrictions on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic.     

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities

Consider a setR ofm binary relations on a set ofn boolean variables.R may imply a contradiction, the fixation of some variables at 0 or at 1 and/or the identification of some pairs of variables in direct or complemented form. An O(n) expected-time algorithm is given for the derivation of all such logical conclusions. Computational experiments with problems involving up to 2000 variables are reported on. The proposed algorithm is more than 100 times faster than previous methods whenn 100.On leave from Faculté Universitaire Catholique de Mons, Belgium. Written at CNRS, LAMSADE. Support of CNRS is gratefully acknowledged.     

Conditions for Permutability of Congruences in Implication Algebras

In this paper we give conditions on an implication algebra A so that two congruences θ ₁, θ ₂ on A permute, i.e. θ ₁ ∘ θ ₂ = θ ₂ ∘ θ ₁. We also provide simpler conditions for permutability in finite implication algebras. Finally we present some applications of these characterizations. The support of Universidad Nacional del Sur and CONICET is gratefully acknowledged.