Displaying 101 – 120 of 143

Showing per page

On the Minkowski-Hölder type inequalities for generalized Sugeno integrals with an application

Michał Boczek, Marek Kaluszka (2016)

Kybernetika

In this paper, we use a new method to obtain the necessary and sufficient condition guaranteeing the validity of the Minkowski-Hölder type inequality for the generalized upper Sugeno integral in the case of functions belonging to a wider class than the comonotone functions. As a by-product, we show that the Minkowski type inequality for seminormed fuzzy integral presented by Daraby and Ghadimi [11] is not true. Next, we study the Minkowski-Hölder inequality for the lower Sugeno integral and the...

p -symmetric bi-capacities

Pedro Miranda, Michel Grabisch (2004)

Kybernetika

Bi-capacities have been recently introduced as a natural generalization of capacities (or fuzzy measures) when the underlying scale is bipolar. They allow to build more flexible models in decision making, although their complexity is of order 3 n , instead of 2 n for fuzzy measures. In order to reduce the complexity, the paper proposes the notion of p -symmetric bi- capacities, in the same spirit as for p -symmetric fuzzy measures. The main idea is to partition the set of criteria (or states of nature,...

Possibilistic alternatives of elementary notions and relations of the theory of belief functions

Ivan Kramosil (2001)

Kybernetika

The elementary notions and relations of the so called Dempster–Shafer theory, introducing belief functions as the basic numerical characteristic of uncertainty, are modified to the case when probabilistic measures and basic probability assignments are substituted by possibilistic measures and basic possibilistic assignments. It is shown that there exists a high degree of formal similarity between the probabilistic and the possibilistic approaches including the role of the possibilistic Dempster...

Probabilistic propositional calculus with doubled nonstandard semantics

Ivan Kramosil (1999)

Kybernetika

The classical propositional language is evaluated in such a way that truthvalues are subsets of the set of all positive integers. Such an evaluation is projected in two different ways into the unit interval of real numbers so that two real-valued evaluations are obtained. The set of tautologies is proved to be identical, in all the three cases, with the set of classical propositional tautologies, but the induced evaluations meet some natural properties of probability measures with respect to nonstandard...

Program for generating fuzzy logical operations and its use in mathematical proofs

Tomáš Bartušek, Mirko Navara (2002)

Kybernetika

Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval [ 0 , 1 ] . Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions ( t -norms). It allows also to select these t -norms according to...

Radon-Nikodym derivatives and conditioning in fuzzy measure theory.

Domenico Candeloro, Sabrina Pucci (1987)

Stochastica

In the last twenty years many papers have appeared dealing with fuzzy theory. In particular, fuzzy integration theory had its origin in the well-known Thesis of Sugeno [7]. More recently, some authors faced this topic by means of some binary operations (see for instance [3], [8] and references): a fuzzy measure must be additive with respect to one of them, an the integral is to define in a way, which is very similar to the construction of the Lebesgue integral. On the contrary, we are interested...

S -measures, T -measures and distinguished classes of fuzzy measures

Peter Struk, Andrea Stupňanová (2006)

Kybernetika

S -measures are special fuzzy measures decomposable with respect to some fixed t-conorm S . We investigate the relationship of S -measures with some distinguished properties of fuzzy measures, such as subadditivity, submodularity, belief, etc. We show, for example, that each S P -measure is a plausibility measure, and that each S -measure is submodular whenever S is 1-Lipschitz.

Selection and correction of weighted rules based on Łukasiewicz's fuzzy logic with evaluated syntax

Jiří Ivánek (2017)

Kybernetika

The core of the expert knowledge is typically represented by a set of rules (implications) assigned with weights specifying their (un)certainties. In the paper, a method for hierarchical selection and correction of expert's weighted rules is described particularly in the case when Łukasiewicz's fuzzy logic with evaluated syntax for dealing with weights is used.

Several results on set-valued possibilistic distributions

Ivan Kramosil, Milan Daniel (2015)

Kybernetika

When proposing and processing uncertainty decision-making algorithms of various kinds and purposes, we more and more often meet probability distributions ascribing non-numerical uncertainty degrees to random events. The reason is that we have to process systems of uncertainties for which the classical conditions like σ -additivity or linear ordering of values are too restrictive to define sufficiently closely the nature of uncertainty we would like to specify and process. In cases of non-numerical...

Software cost estimation with fuzzy inputs: Fuzzy modelling and aggregation of cost drivers

Miguel-Ángel Sicilia, Juan-J. Cuadrado-Gallego, Javier Crespo, Elena García Barriocanal (2005)

Kybernetika

Parametric software cost estimation models are well-known and widely used estimation tools, and several fuzzy extensions have been proposed to introduce a explicit handling of imprecision and uncertainty as part of them. Nonetheless, such extensions do not consider two basic facts that affect the inputs of software cost parametric models: cost drivers are often expressed through vague linguistic categories, and in many cases cost drivers are better expressed in terms of aggregations of second-level...

Some topological properties of ω -covering sets

Andrzej Nowik (2000)

Czechoslovak Mathematical Journal

We prove the following theorems: There exists an ω -covering with the property s 0 . Under c o v ( 𝒩 ) = there exists X such that B o r [ B X is not an ω -covering or X B is not an ω -covering]. Also we characterize the property of being an ω -covering.

Currently displaying 101 – 120 of 143