Displaying similar documents to “Inference of fuzzy regular grammars from examples.”

Modeling a fuzzy coprocessor and its programming language.

Ricardo García Rosa, Teresa de Pedro Lucio (1998)

Mathware and Soft Computing

Similarity:

A computational model for a fuzzy coprocessor (types and structures of data and the set of instructions) is proposed. The coprocessor will be charged only of the typical operations of fuzzy logic as calculating membership degrees, unions and intersections of fuzzy sets, fuzzy inferences, defuzzifications and so on. One main novelty is that the programming language admits fuzzy rules conditions in which there would be linguistic edges preceding the predicates and the coprocessor is designed...

A language for expressing fuzzy temporal rules.

Purificación Cariñena, Alberto Bugarín, Manuel Mucientes, Senén Barro (2000)

Mathware and Soft Computing

Similarity:

This paper deals with the formal description of what we call Fuzzy Temporal Propositions: propositions with explicitly expressed information of a temporal type. The set of syntactic rules that make a grammar up for defining a language for this kind of propositions is presented. For some of the rules, examples that illustrate the expressive power of this type of knowledge representation are introduced. Semantic criteria and definitions are also introduced through examples in order to...

Evolutionary algorithms and fuzzy sets for discovering temporal rules

Stephen G. Matthews, Mario A. Gongora, Adrian A. Hopgood (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns...

The similarity of two strings of fuzzy sets

Gabriela Andrejková (2000)

Kybernetika

Similarity:

Let 𝒜 , ℬ be the strings of fuzzy sets over χ , where χ is a finite universe of discourse. We present the algorithms for operations on fuzzy sets and the polynomial time algorithms to find the string 𝒞 over χ which is a closest common subsequence of fuzzy sets of 𝒜 and ℬ using different operations to measure a similarity of fuzzy sets.

Towards a fuzzy computability?

Claudio Moraga (1999)

Mathware and Soft Computing

Similarity:

The subject of the present paper is the study of fuzzy computability based on fuzzy Turing machines. Two different models of fuzzy Turing machines will be discussed. It is shown that most work on fuzzy mathematics may be conducted within the frame of classical computability and the rest falls within the area of computability of the reals.

Some practical problems in fuzzy sets-based decision support systems.

Alejandro Sancho-Royo, José Luis Verdegay, Edmundo Vergara-Moreno (1999)

Mathware and Soft Computing

Similarity:

In this paper some problems arising in the interface between two different areas, Decision Support Systems and Fuzzy Sets and Systems, are considered. The Model-Base Management System of a Decision Support System which involves some fuzziness is considered, and in that context the question, first, of the practical determination of membership functions, second of the management of the fuzziness in some optimisation models, and finally of using fuzzy rules for terminating conventional...