A Deep Study of Fuzzy Implications

This thesis contributes a deep study on the extensions of the IMPLY operator in classical binary logic to fuzzy logic, which are called fuzzy implications. After the introduction in Chapter 1 and basic notations about the fuzzy logic operators In Chapter 2 we first characterize In Chapter 3 S- and R- implications and then extensively investigate under which conditions QL-implications satisfy the thirteen fuzzy implication axioms. In Chapter 4 we develop the complete interrelationships between the eight supplementary axioms FI6-FI13 for fuzzy implications satisfying the five basic axioms FI1-FI15. We prove all the dependencies between the eight fuzzy implication axioms, and provide for each independent case a counter-example. The counter-examples provided in this chapter can be used in the applications that need different fuzzy implications satisfying different fuzzy implication axioms. In Chapter 5 we study proper S-, R- and QL-implications for an iterative boolean-like scheme of reasoning from classical binary logic in the frame of fuzzy logic. Namely, repeating antecedents $n$ times, the reasoning result will remain the same. To determine the proper S-, R- and QL-implications we get a full solution of the functional equation $I(x,y)=I(x,I(x,y))$, for all $x$, $y\in[0,1]$. In Chapter 6 we study for the most important t-norms, t-conorms and S-implications their robustness against different perturbations in a fuzzy rule-based system. We define and compare for these fuzzy logical operators the robustness measures against bounded unknown and uniform distributed perturbations respectively. In Chapter 7 we use a fuzzy implication $I$ to define a fuzzy $I$-adjunction in $\mathcal{F}(\mathbb{R}^{n})$. And then we study the conditions under which a fuzzy dilation which is defined from a conjunction $\mathcal{C}$ on the unit interval and a fuzzy erosion which is defined from a fuzzy implication $I^{'}$ to form a fuzzy $I$-adjunction. These conditions are essential in order that the fuzzification of the morphological operations of dilation, erosion, opening and closing obey similar properties as their algebraic counterparts. We find out that the adjointness between the conjunction $\mathcal{C}$ on the unit interval and the implication $I$ or the implication $I^{'}$ play important roles in such conditions

Fitting aggregation operators to data

Theoretical advances in modelling aggregation of information produced a wide range of aggregation operators, applicable to almost every practical problem. The most important classes of aggregation operators include triangular norms, uninorms, generalised means and OWA operators.With such a variety, an important practical problem has emerged: how to fit the parameters/ weights of these families of aggregation operators to observed data? How to estimate quantitatively whether a given class of operators is suitable as a model in a given practical setting? Aggregation operators are rather special classes of functions, and thus they require specialised regression techniques, which would enforce important theoretical properties, like commutativity or associativity. My presentation will address this issue in detail, and will discuss various regression methods applicable specifically to t-norms, uninorms and generalised means. I will also demonstrate software implementing these regression techniques, which would allow practitioners to paste their data and obtain optimal parameters of the chosen family of operators.<br /

Some characterizations of T-power based implications

Recently, the so-called family of T-power based implications was introduced. These operators involve the use of Zadeh’s quantifiers based on powers of t-norms in its definition. Due to the fact that Zadeh’s quantifiers constitute the usual method to modify fuzzy propositions, this family of fuzzy implication functions satisfies an important property in approximate reasoning such as the invariance of the truth value of the fuzzy conditional when both the antecedent and the consequent are modified using the same quantifier. In this paper, an in-depth analysis of this property is performed by characterizing all binary functions satisfying it. From this general result, a fully characterization of the family of T-power based implications is presented. Furthermore, a second characterization is also proved in which surprisingly the invariance property is not explicitly used.Peer ReviewedPostprint (author's final draft

Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics

This paper focuses on the issue of how generalizations of continuous and left-continuous t-norms over linearly ordered sets should be from a logical point of view. Taking into account recent results in the scope of algebraic semantics for fuzzy logics over chains with a monoidal residuated operation, we advocate linearly ordered BL-algebras and MTL-algebras as adequate generalizations of continuous and left-continuous t-norms respectively. In both cases, the underlying basic structure is that of linearly ordered residuated lattices. Although the residuation property is equivalent to left-continuity in t-norms, continuous t-norms have received much more attention due to their simpler structure. We review their complete description in terms of ordinal sums and discuss the problem of describing the structure of their generalization to BL-chains. In particular we show the good behavior of BL-algebras over a finite or complete chain, and discuss the partial knowledge of rational BL-chains. Then we move to the general non-continuous case corresponding to left-continuous t-norms and MTL-chains. The unsolved problem of describing the structure of left-continuous t-norms is presented together with a fistful of construction-decomposition techniques that apply to some distinguished families of t-norms and, finally, we discuss the situation in the general study of MTL-chains as a natural generalization of left-continuous t-norms

Relating Kleene algebras with pseudo uninorms

This paper explores a strict relation between two core notions of the semantics of programs and of fuzzy logics: Kleene Algebras and (pseudo) uninorms. It shows that every Kleene algebra induces a pseudo uninorm, and that some pseudo uninorms induce Kleene algebras. This connection establishes a new perspective on the theory of Kleene algebras and provides a way to build (new) Kleene algebras. The latter aspect is potentially useful as a source of formalism to capture and model programs acting with fuzzy behaviours and domains.publishe

Fuzzy Description Logics with General Concept Inclusions

Description logics (DLs) are used to represent knowledge of an application domain and provide standard reasoning services to infer consequences of this knowledge. However, classical DLs are not suited to represent vagueness in the description of the knowledge. We consider a combination of DLs and Fuzzy Logics to address this task. In particular, we consider the t-norm-based semantics for fuzzy DLs introduced by Hájek in 2005. Since then, many tableau algorithms have been developed for reasoning in fuzzy DLs. Another popular approach is to reduce fuzzy ontologies to classical ones and use existing highly optimized classical reasoners to deal with them. However, a systematic study of the computational complexity of the different reasoning problems is so far missing from the literature on fuzzy DLs. Recently, some of the developed tableau algorithms have been shown to be incorrect in the presence of general concept inclusion axioms (GCIs). In some fuzzy DLs, reasoning with GCIs has even turned out to be undecidable. This work provides a rigorous analysis of the boundary between decidable and undecidable reasoning problems in t-norm-based fuzzy DLs, in particular for GCIs. Existing undecidability proofs are extended to cover large classes of fuzzy DLs, and decidability is shown for most of the remaining logics considered here. Additionally, the computational complexity of reasoning in fuzzy DLs with semantics based on finite lattices is analyzed. For most decidability results, tight complexity bounds can be derived

DUALITIES AND REPRESENTATIONS FOR MANY-VALUED LOGICS IN THE HIERARCHY OF WEAK NILPOTENT MINIMUM.

In this thesis we study particular subclasses of WNM algebras. The variety of WNM algebras forms the algebraic semantics of the WNM logic, a propositional many-valued logic that generalizes some well-known case in the setting of triangular norms logics. WNM logic lies in the hierarchy of schematic extensions of MTL, which is proven to be the logic of all left-continuous triangular norms and their residua. In this work, I have extensively studied two extensions of WNM logic, namely RDP logic and NMG logic, from the point of view of algebraic and categorical logic. We develop spectral dualities between the varieties of algebras corresponding to RDP logic and NMG logic, and suitable defined combinatorial categories. Categorical dualities allow to give algorithmic construction of products in the dual categories obtaining computable descriptions of coproducts (which are notoriously hard to compute working only in the algebraic side) for the corresponding finite algebras. As a byproduct, representation theorems for finite algebras and free finitely generated algebras in the considered varieties are obtained. This latter characterization is especially useful to provide explicit construction of a number of objects relevant from the point of view of the logical interpretation of the varieties of algebras: normal forms, strongest deductive interpolants and most general unifiers