نتایج جستجو برای: fuzzy equational class

تعداد نتایج: 488099  

1999
Antonino Salibra

The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the rst-order predicate logic. In this paper we prove that the variety of lambda abstraction algebras is not congruence modular and that the lattice of lambda theories is not modular.

Journal: :Fuzzy Sets and Systems 1997
Adnan Yazici Murat Koyuncu

This paper presents a modeling approach which couples fuzzy object-oriented database modeling with fuzzy logic. The modeling approach introduced here handles fuzziness at attribute, object/class and class/superclass levels in addition to fuzziness in class/class relationships and various associations among classes. We utilize logical rules to define some of the crisp/fuzzy relationships and ass...

Journal: :International Journal of Foundations of Computer Science 2012

Journal: :Annals of Pure and Applied Logic 1994

In this paper, we introduce a new class of implicit functions and also common property (E.A) in modified intuitionistic fuzzy metric spaces and utilize the same to prove some common fixed point theorems in modified intuitionistic fuzzy metric spaces besides discussing related results and illustrative examples. We are not aware of any paper dealing with such implicit functions in modified intuit...

Journal: :Inf. Sci. 1999
Jonathan Lee Nien-Lin Xue Kuo-Hsun Hsu Stephen J. H. Yang

One of the foci of the recent development in object-oriented modeling (OOM) has been the extension of OOM to fuzzy logic to capture and analyze informal requirements that are imprecise in nature. In this paper, a new approach to object-oriented modeling based on fuzzy logic is proposed to formulate imprecise requirements along four dimensions: (1) to extend a class by grouping objects with simi...

2001
Christopher Lynch Barbara Morawska

We deene a subclass of the class of linear equational theories, called nitely closable linear theories. We consider uniication problems with no repeated variables. We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic nitely closable linear theories.

Journal: :journal of ai and data mining 2014
amirmohammad shafiee ali mohammad latif

fuzzy segmentation is an effective way of segmenting out objects in images containing both random noise and varying illumination. in this paper, a modified method based on the comprehensive learning particle swarm optimization (clpso) is proposed for pixel classification in hsi color space by selecting a fuzzy classification system with minimum number of fuzzy rules and minimum number of incorr...

2007
Hajnal Andréka Steven Givant István Németi

The foundation of an algebraic theory of binary relations was laid by C. S. Peirce, building on earlier work of Boole and De Morgan. The basic universe of discourse of this theory is a collection of binary relations over some set, and the basic operations on these relations are those of forming unions, complements, relative products (i.e., compositions), and converses (i.e., inverses). There is...

2006
Bohdan S. Butkiewicz

The paper presents second author’s step toward building quite new theory of fuzzy signals. Before, in the first step author defined fuzzy Fourier transform. Here, an approach to description of fuzzy correlation functions is proposed. New definitions, called later fuzzy correlation and defuzzified correlation are proposed for fuzzy signals. The definitions are based on new concepts of the class ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید