The *-composition -A Novel Generating Method of Fuzzy Implications: An Algebraic Study

Fuzzy implications are one of the two most important fuzzy logic connectives, the other being t-norms. They are a generalisation of the classical implication from two-valued logic to the multivalued setting. A binary operation I on [0; 1] is called a fuzzy implication if (i) I is decreasing in the first variable, (ii) I is increasing in the second variable, (iii) I(0; 0) = I(1; 1) = 1 and I(1; 0) = 0. The set of all fuzzy implications defined on [0; 1] is denoted by I. Fuzzy implications have many applications in fields like fuzzy control, approximate reasoning, decision making, multivalued logic, fuzzy image processing, etc. Their applicational value necessitates new ways of generating fuzzy implications that are fit for a specific task. The generating methods of fuzzy implications can be broadly categorised as in the following: (M1): From binary functions on [0; 1], typically other fuzzy logic connectives, viz., (S;N)-, R-, QL- implications, (M2): From unary functions on [0,1], typically monotonic functions, for instance, Yager’s f-, g- implications, or from fuzzy negations, (M3): From existing fuzzy implications

Eigenlogic: a Quantum View for Multiple-Valued and Fuzzy Systems

We propose a matrix model for two- and many-valued logic using families of observables in Hilbert space, the eigenvalues give the truth values of logical propositions where the atomic input proposition cases are represented by the respective eigenvectors. For binary logic using the truth values {0,1} logical observables are pairwise commuting projectors. For the truth values {+1,-1} the operator system is formally equivalent to that of a composite spin 1/2 system, the logical observables being isometries belonging to the Pauli group. Also in this approach fuzzy logic arises naturally when considering non-eigenvectors. The fuzzy membership function is obtained by the quantum mean value of the logical projector observable and turns out to be a probability measure in agreement with recent quantum cognition models. The analogy of many-valued logic with quantum angular momentum is then established. Logical observables for three-value logic are formulated as functions of the Lz observable of the orbital angular momentum l=1. The representative 3-valued 2-argument logical observables for the Min and Max connectives are explicitly obtained.Comment: 11 pages, 2 table

Eigenlogic: Interpretable Quantum Observables with applications to Fuzzy Behavior of Vehicular Robots

This work proposes a formulation of propositional logic, named Eigenlogic, using quantum observables as propositions. The eigenvalues of these operators are the truth-values and the associated eigenvectors the interpretations of the propositional system. Fuzzy logic arises naturally when considering vectors outside the eigensystem, the fuzzy membership function is obtained by the Born rule of the logical observable.This approach is then applied in the context of quantum robots using simple behavioral agents represented by Braitenberg vehicles. Processing with non-classical logic such as multivalued logic, fuzzy logic and the quantum Eigenlogic permits to enlarge the behavior possibilities and the associated decisions of these simple agents

Dual Logic Concepts based on Mathematical Morphology in Stratified Institutions: Applications to Spatial Reasoning

Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to define, at the abstract level of institutions, a pair of abstract dual and logical operators as morphological erosion and dilation. Standard quantifiers and modalities are then derived from these two abstract logical operators. These operators are studied both on sets of states and sets of models. To cope with the lack of explicit set of states in institutions, the proposed abstract logical dual operators are defined in an extension of institutions, the stratified institutions, which take into account the notion of open sentences, the satisfaction of which is parametrized by sets of states. A hint on the potential interest of the proposed framework for spatial reasoning is also provided.Comment: 36 page

Interval-valued and intuitionistic fuzzy mathematical morphologies as special cases of L-fuzzy mathematical morphology

Mathematical morphology (MM) offers a wide range of tools for image processing and computer vision. MM was originally conceived for the processing of binary images and later extended to gray-scale morphology. Extensions of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory that give rise to fuzzy mathematical morphology (FMM). From a mathematical point of view, FMM relies on the fact that the class of all fuzzy sets over a certain universe forms a complete lattice. Recall that complete lattices provide for the most general framework in which MM can be conducted. The concept of L-fuzzy set generalizes not only the concept of fuzzy set but also the concepts of interval-valued fuzzy set and Atanassov’s intuitionistic fuzzy set. In addition, the class of L-fuzzy sets forms a complete lattice whenever the underlying set L constitutes a complete lattice. Based on these observations, we develop a general approach towards L-fuzzy mathematical morphology in this paper. Our focus is in particular on the construction of connectives for interval-valued and intuitionistic fuzzy mathematical morphologies that arise as special, isomorphic cases of L-fuzzy MM. As an application of these ideas, we generate a combination of some well-known medical image reconstruction techniques in terms of interval-valued fuzzy image processing

A Fuzzy Logic Programming Environment for Managing Similarity and Truth Degrees

FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. FASILL integrates and extends features coming from MALP (Multi-Adjoint Logic Programming, a fuzzy logic language with explicitly annotated rules) and Bousi~Prolog (which uses a weak unification algorithm and is well suited for flexible query answering). Hence, it properly manages similarity and truth degrees in a single framework combining the expressive benefits of both languages. This paper presents the main features and implementations details of FASILL. Along the paper we describe its syntax and operational semantics and we give clues of the implementation of the lattice module and the similarity module, two of the main building blocks of the new programming environment which enriches the FLOPER system developed in our research group.Comment: In Proceedings PROLE 2014, arXiv:1501.0169

Interpolation Methods for Binary and Multivalued Logical Quantum Gate Synthesis

A method for synthesizing quantum gates is presented based on interpolation methods applied to operators in Hilbert space. Starting from the diagonal forms of specific generating seed operators with non-degenerate eigenvalue spectrum one obtains for arity-one a complete family of logical operators corresponding to all the one-argument logical connectives. Scaling-up to n-arity gates is obtained by using the Kronecker product and unitary transformations. The quantum version of the Fourier transform of Boolean functions is presented and a Reed-Muller decomposition for quantum logical gates is derived. The common control gates can be easily obtained by considering the logical correspondence between the control logic operator and the binary propositional logic operator. A new polynomial and exponential formulation of the Toffoli gate is presented. The method has parallels to quantum gate-T optimization methods using powers of multilinear operator polynomials. The method is then applied naturally to alphabets greater than two for multi-valued logical gates used for quantum Fourier transform, min-max decision circuits and multivalued adders