نتایج جستجو برای: lukasiewicz composition
تعداد نتایج: 260165 فیلتر نتایج به سال:
For the purpose of applying concept Lukasiewicz fuzzy set to ideals in BE-algebras, ideal is introduced, and its properties are studied. The relationship between discussed. Conditions for be a provided, characterizations displayed. which three subsets, called ∈-set, q-set O-set, explored.
We explore different ways to generalize Hintikka’s classic game theoretic semantic to a many-valued setting, where the unit interval is taken as the set of truth values. In this manner a plethora of characterizations of Lukasiewicz logic arise. Among the described semantic games is Giles’s dialogue and betting game, presented in a manner that makes the relation to Hintikka’s game more transpare...
A fuzzy control system based on a new method called maximal fuzzy similarity in fact the equivalence relation of Lukasiewicz logic is introduced to control an isolated pedestrian crossing signals The main goal in this multi objective optimization problem is to minimize both pedestrians and vehi cles delay and make the tra c ow as u ent and safe as possible Lukasiewicz many valued logic in known...
The paper deals with fuzzy logic in narrow sense of Lukasiewicz style, i.e. a special kind of many-valued logic which is aimed at modeling of vagueness phenomenon. This logic is a generalization of Lukasiewicz logic with many interesting properties (for example, generalization of the deduction and completeness theorems hold in it). Our aim is to prepare the background for the resolution in fuzz...
We proposed in this paper to use some ideas of Jan Lukasiewicz, concerning independence of logical formulas, to study dependencies in databases.
Lukasiewicz logic arrays (LLAs) are analog VLSI circuits structured as trees of continuous-valued implications. First described in 1990, LLAs are now nding uses as applicationspeci c array processors for image processing, fuzzy inference, and robotic control. Yet an early question persists: Why do LLAs work? Intuitively, a small error should build up through successive implications of an arbitr...
The fundamentals of à Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces...
We define the Lukasiewicz Transform as a residuated map and a homomorphism between semimodules over the semiring reducts of an MV-algebra. Then we describe the “ Lukasiewicz Transform Based” ( LTB) algorithm for image processing. We also propose a strong extension of such concepts and results in the framework of quantales and quantale modules. 1 The Lukasiewicz transform and its applications Th...
In this paper, we introduce generalized connectivity in L-fuzzy topological spaces by à Lukasiewicz logic and prove K. Fan’s theorem.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید