Incorporating the Basic Elements of a First-degree Fuzzy Logic and Certain Elments of Temporal Logic for Dynamic Management Applications

The approximate reasoning is perceived as a derivation of new formulas with the corresponding temporal attributes, within a fuzzy theory defined by the fuzzy set of special axioms. For dynamic management applications, the reasoning is evolutionary because of unexpected events which may change the state of the expert system. In this kind of situations it is necessary to elaborate certain mechanisms in order to maintain the coherence of the obtained conclusions, to figure out their degree of reliability and the time domain for which these are true. These last aspects stand as possible further directions of development at a basic logic level. The purpose of this paper is to characterise an extended fuzzy logic system with modal operators, attained by incorporating the basic elements of a first-degree fuzzy logic and certain elements of temporal logic.Dynamic Management Applications, Fuzzy Reasoning, Formalization, Time Restrictions, Modal Operators, Real-Time Expert Decision System (RTEDS)

The ⊛-composition of fuzzy implications: Closures with respect to properties, powers and families

Recently, Vemuri and Jayaram proposed a novel method of generating fuzzy implications from a given pair of fuzzy implications. Viewing this as a binary operation ⊛ on the set II of fuzzy implications they obtained, for the first time, a monoid structure (I,⊛)(I,⊛) on the set II. Some algebraic aspects of (I,⊛)(I,⊛) had already been explored and hitherto unknown representation results for the Yager's families of fuzzy implications were obtained in [53] (N.R. Vemuri and B. Jayaram, Representations through a monoid on the set of fuzzy implications, fuzzy sets and systems, 247 (2014) 51–67). However, the properties of fuzzy implications generated or obtained using the ⊛-composition have not been explored. In this work, the preservation of the basic properties like neutrality, ordering and exchange principles , the functional equations that the obtained fuzzy implications satisfy, the powers w.r.t. ⊛ and their convergence, and the closures of some families of fuzzy implications w.r.t. the operation ⊛, specifically the families of (S,N)(S,N)-, R-, f- and g-implications, are studied. This study shows that the ⊛-composition carries over many of the desirable properties of the original fuzzy implications to the generated fuzzy implications and further, due to the associativity of the ⊛-composition one can obtain, often, infinitely many new fuzzy implications from a single fuzzy implication through self-composition w.r.t. the ⊛-composition

An Abstract Approach to Consequence Relations

We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents or equations), these objects are invariably aggregated via set-theoretical union. Our approach is more general in that non-idempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. In their abstract form, thus, deductive relations are defined as additional compatible preorderings over certain partially ordered monoids. We investigate these relations using categorical methods, and provide analogues of the main results obtained in the general theory of consequence relations. Then we focus on the driving example of multiset deductive relations, providing variations of the methods of matrix semantics and Hilbert systems in Abstract Algebraic Logic

Homomorphisms on the monoid of fuzzy implications and the iterative functional equation I(x,I(x,y))=I(x,y)

Recently, Vemuri and Jayaram proposed a novel method of generating fuzzy implications, called the ⊛⊛-composition, from a given pair of fuzzy implications [Representations through a Monoid on the set of Fuzzy Implications, Fuzzy Sets and Systems, 247, 51-67]. However, as with any generation process, the ⊛⊛-composition does not always generate new fuzzy implications. In this work, we study the generative power of the ⊛⊛-composition. Towards this end, we study some specific functional equations all of which lead to the solutions of the iterative functional equation I(x,I(x,y))=I(x,y)I(x,I(x,y))=I(x,y) involving fuzzy implications which has been studied extensively for different families of fuzzy implications in this very journal, see [Information Sciences 177, 2954–2970 (2007); 180, 2487–2497 (2010); 186, 209–221 (2012)]. In this work, unlike in other existing works, we do not restrict the solutions to a particular family of fuzzy implications. Thus we take an algebraic approach towards solving these functional equations. Viewing the ⊛⊛-composition as a binary operation ⊛⊛ on the set II of all fuzzy implications one obtains a monoid structure (I,⊛)(I,⊛) on the set II. From the Cayley’s theorem for monoids, we know that any monoid is isomorphic to the set of all right translations. We determine the complete set KK of fuzzy implications w.r.t. which the right translations also become semigroup homomorphisms on the monoid (I,⊛I,⊛) and show that KK not only answers our questions regarding the generative power of the ⊛⊛-composition but also contains many as yet unknown solutions of the iterative functional equation I(x,I(x,y))=I(x,y)I(x,I(x,y))=I(x,y)

Generalising KAT to verify weighted computations

Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of this structure able to express programs as weighted transitions and tests with outcomes in non necessarily bivalent truth spaces: graded Kleene algebra with tests (GKAT) and a variant where tests are also idempotent (I-GKAT). In this context, and in analogy to Kozen's encoding of Propositional Hoare Logic (PHL) in KAT we discuss the encoding of a graded PHL in I-GKAT and of its while-free fragment in GKAT. Moreover, to establish semantics for these structures four new algebras are de ned: FSET (T ), FREL(K; T ) and FLANG(K; T ) over complete residuated lattices K and T , and M(n;A) over a GKAT or I-GKAT A. As a nal exercise, the paper discusses some program equivalence proofs in a graded context.POCI-01-0145-FEDER-03094, NORTE-01-0145-FEDER-000037. ERDF – European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation - COMPETE 2020 Programme and by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project POCI-01-0145-FEDER-030947. This paper is also a result of the project SmartEGOV, NORTE-01-0145-FEDER-000037. The second author is supported in the scope of the framework contract foreseen in the numbers 4, 5 and 6 of the article 23, of the Decree-Law 57/2016, of August 29, changed by Portuguese Law 57/2017, of July 19, at CIDMA (Centro de Investigação e Desenvolvimento em Matemática e Aplicações) UID/MAT/04106/2019

Computer-Aided Discovery and Categorisation of Personality Axioms

We propose a computer-algebraic, order-theoretic framework based on intuitionistic logic for the computer-aided discovery of personality axioms from personality-test data and their mathematical categorisation into formal personality theories in the spirit of F.~Klein's Erlanger Programm for geometrical theories. As a result, formal personality theories can be automatically generated, diagrammatically visualised, and mathematically characterised in terms of categories of invariant-preserving transformations in the sense of Klein and category theory. Our personality theories and categories are induced by implicational invariants that are ground instances of intuitionistic implication, which we postulate as axioms. In our mindset, the essence of personality, and thus mental health and illness, is its invariance. The truth of these axioms is algorithmically extracted from histories of partially-ordered, symbolic data of observed behaviour. The personality-test data and the personality theories are related by a Galois-connection in our framework. As data format, we adopt the format of the symbolic values generated by the Szondi-test, a personality test based on L.~Szondi's unifying, depth-psychological theory of fate analysis.Comment: related to arXiv:1403.200

Application of an automatically designed fuzzy logic decision support system to connection admission control in ATM networks

PhDAbstract not availabl

Fuzzy Knowledge Based Reliability Evaluation and Its Application to Power Generating System

PhDThe method of using Fuzzy Sets Theory(FST) and Fuzzy Reasoning(FR) to aid reliability evaluation in a complex and uncertain environment is studied, with special reference to electrical power generating system reliability evaluation. Device(component) reliability prediction contributes significantly to a system's reliability through their ability to identify source and causes of unreliability. The main factors which affect reliability are identified in Reliability Prediction Process(RPP). However, the relation between reliability and each affecting factor is not a necessary and sufficient one. It is difficult to express this kind of relation precisely in terms of quantitative mathematics. It is acknowledged that human experts possesses some special characteristics that enable them to learn and reason in a vague and fuzzy environment based on their experience. Therefore, reliability prediction can be classified as a human engineer oriented decision process. A fuzzy knowledge based reliability prediction framework, in which speciality rather than generality is emphasised, is proposed in the first part of the thesis. For this purpose, various factors affected device reliability are investigated and the knowledge trees for predicting three reliability indices, i.e. failure rate, maintenance time and human error rate are presented. Human experts' empirical and heuristic knowledge are represented by fuzzy linguistic rules and fuzzy compositional rule of inference is employed as inference tool. Two approaches to system reliability evaluation are presented in the second part of this thesis. In first approach, fuzzy arithmetic are conducted as the foundation for system reliability evaluation under the fuzzy envimnment The objective is to extend the underlying fuzzy concept into strict mathematics framework in order to arrive at decision on system adequacy based on imprecise and qualitative information. To achieve this, various reliability indices are modelled as Trapezoidal Fuzzy Numbers(TFN) and are proceeded by extended fuzzy arithmetic operators. In second approach, the knowledge of system reliability evaluation are modelled in the form of fuzzy combination production rules and device combination sequence control algorithm. System reliability are evaluated by using fuzzy inference system. Comparison of two approaches are carried out through case studies. As an application, power generating system reliability adequacy is studied. Under the assumption that both unit reliability data and load data are subjectively estimated, these fuzzy data are modelled as triangular fuzzy numbers, fuzzy capacity outage model and fuzzy load model are developed by using fuzzy arithmetic operations. Power generating system adequacy is evaluated by convoluting fuzzy capacity outage model with fuzzy load model. A fuzzy risk index named "Possibility Of Load Loss" (POLL) is defined based on the concept of fuzzy containment The proposed new index is tested on IEEE Reliability Test System (RTS) and satisfactory results are obtained Finally, the implementation issues of Fuzzy Rule Based Expert System Shell (FRBESS) are reported. The application of ERBESS to device reliability prediction and system reliability evaluation is discussed