Contracting and Involutive Negations of Probability Distributions [PDF]
Mathematics, 2021 A dozen papers have considered the concept of negation of probability distributions (pd) introduced by Yager. Usually, such negations are generated point-by-point by functions defined on a set of probability values and called here negators.
Ildar Z. Batyrshin
doaj +5 more sources
Fuzzy logics with an additional involutive negation
Fuzzy Sets and Systems, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cintula, P. (Petr) +3 more
openaire +5 more sources
Implicator-Conjunctor Based Models of Fuzzy Rough Sets: Definitions and Properties [PDF]
, 2016 Ever since the first hybrid fuzzy rough set model was pro- posed in the early 1990¿s, many researchers have focused on the definition of the lower and upper approximation of a fuzzy set by means of a fuzzy relation.
Cornelis, Chris +3 more
core +5 more sources
Reducing fuzzy answer set programming to model finding in fuzzy logics [PDF]
, 2011 In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the
Bauters +23 more
core +3 more sources
A comprehensive study of implicator-conjunctor based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis [PDF]
, 2015 © 2014 Elsevier B.V. Both rough and fuzzy set theories offer interesting tools for dealing with imperfect data: while the former allows us to work with uncertain and incomplete information, the latter provides a formal setting for vague concepts. The two
D'eer, Lynn +3 more
core +1 more source
Formulae-as-types for an involutive negation [PDF]
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014 Negation is not involutive in the λC calculus because it does not distinguish captured stacks from continuations. We show that there is a formulae-as-types correspondence between the involutive negation in proof theory, and a notion of high-level access to the stacks studied by Felleisen and Clements. We introduce polarised, untyped, calculi compatible
openaire +2 more sources
Some Technical Remarks on Negations of Discrete Probability Distributions and Their Information Loss [PDF]
, 2022 Negation of a discrete probability distribution was introduced by Yager. To date, several papers have been published discussing generalizations, properties, and applications of negation. The recent work by Wu et al.
Klein, Ingo
core +2 more sources
Quasi-arithmetic means and OWA functions in interval-valued and Atanassov's intuitionistic fuzzy set theory [PDF]
, 2011 In this paper we propose an extension of the well-known OWA functions introduced by Yager to interval-valued (IVFS) and Atanassov’s intuitionistic (AIFS) fuzzy set theory.
Deschrijver, Glad
core +2 more sources
Residuated fuzzy logics with an involutive negation
Archive for Mathematical Logic, 2000 Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant 0̄, namely ¬φ is φ → 0̄.
Esteva, Francesc +3 more
openaire +3 more sources
Distinguishing standard SBL‐algebras with involutive negations by propositional formulas
Mathematical Logic Quarterly, 2008 AbstractPropositional fuzzy logics given by a combination of a continuous SBL t‐norm with finitely many idempotents and of an involutive negation are investigated. A characterization of continuous t‐norms which, in combination with different involutive negations, yield either isomorphic algebras or algebras with distinct and incomparable sets of ...
Haniková, Z. (Zuzana) +1 more
openaire +3 more sources