Lattice Generalizations of the Concept of Fuzzy Numbers and Zadeh's Extension Principle

• URL: http://arxiv.org/abs/2208.06224v1
• Date: Fri, 12 Aug 2022 11:32:33 GMT
• Title: Lattice Generalizations of the Concept of Fuzzy Numbers and Zadeh's Extension Principle
• Authors: Dmitry Maximov
• Abstract summary: The concept of a fuzzy number is generalized to the case of a finite carrier set of partially ordered elements. The use of partially ordered values in cognitive maps with comparison of expert assessments is considered.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The concept of a fuzzy number is generalized to the case of a finite carrier set of partially ordered elements, more precisely, a lattice, when a membership function also takes values in a partially ordered set (a lattice). Zadeh's extension principle for determining the degree of membership of a function of fuzzy numbers is corrected for this generalization. An analogue of the concept of mean value is also suggested. The use of partially ordered values in cognitive maps with comparison of expert assessments is considered.

Related papers

• Explicit error bounds for entanglement transformations between sparse multipartite states [0.0]
  A nontrivial family of such functional exponents has recently been constructed. We derive a new regularised formula for these functionals in terms of a subadditive upper bound. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication.
  arXiv  Detail & Related papers  (2023-09-20T16:06:48Z)
• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• An approach to robust ICP initialization [77.45039118761837]
  We propose an approach to initialize the Iterative Closest Point (ICP) algorithm to match unlabelled point clouds related by rigid transformations. We derive bounds on the robustness of our approach to noise and numerical experiments confirm our theoretical findings.
  arXiv  Detail & Related papers  (2022-12-10T16:27:25Z)
• On Fuzzy Cardinal Semantic Transformations [77.34726150561087]
  fuzzy cardinal semantic transformation as a basis for creating fuzzy semantic numeration systems is introduced in this work. Both fuzziness of the initial data - cardinals of abstract entities - and fuzziness of the parameters of the cardinal semantic operators are considered.
  arXiv  Detail & Related papers  (2022-05-27T16:17:58Z)
• Attribute Selection using Contranominal Scales [0.09668407688201358]
  Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. The size of such a lattice depends on the number of subcontexts in the corresponding formal context. We propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context.
  arXiv  Detail & Related papers  (2021-06-21T10:53:50Z)
• On the KLM properties of a fuzzy DL with Typicality [0.0]
  The extension of fuzzy logic with a typicality operator was proposed in recent work to define a fuzzy multipreference semantics for Multilayer Perceptrons. In this paper, we study its properties.
  arXiv  Detail & Related papers  (2021-06-01T10:57:46Z)
• Superposition with Lambdas [59.87497175616048]
  We design a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $betaeta$-equivalence classes of $lambda$-terms and rely on higher-order unification to achieve refutational completeness.
  arXiv  Detail & Related papers  (2021-01-31T13:53:17Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Generalized Score Matching for General Domains [6.982738885923204]
  Estimation of density functions supported on general domains arises when the data is naturally restricted to a proper subset of the real space. We offer a natural generalization of score matching that accommodates densities supported on a very general class of domains.
  arXiv  Detail & Related papers  (2020-09-24T00:53:04Z)
• Relative Deviation Margin Bounds [55.22251993239944]
  We give two types of learning bounds, both distribution-dependent and valid for general families, in terms of the Rademacher complexity. We derive distribution-dependent generalization bounds for unbounded loss functions under the assumption of a finite moment.
  arXiv  Detail & Related papers  (2020-06-26T12:37:17Z)
• Reasoning about Typicality and Probabilities in Preferential Description Logics [0.15749416770494704]
  We describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T. This extension is based on a minimal model semantics corresponding to a notion of rational closure. We consider other strengthening of the rational closure semantics and construction to avoid the so-called blocking of property inheritance problem.
  arXiv  Detail & Related papers  (2020-04-20T14:50:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.