A characterization of arbitrary Ruspini partitions by fuzzy similarity relations

2002 ◽  
Author(s):  
H. Thiele
Keyword(s):  
Similarity Relations ◽  
Fuzzy Similarity

Comparison of Dispersion Models by Using Fuzzy Similarity Relations

2011 ◽  
pp. 57-67 ◽  
Author(s):  
Angelo Ciaramella ◽  
Angelo Riccio ◽  
Stefano Galmarini ◽  
Giulio Giunta ◽  
Slawomir Potempski
Keyword(s):  
Dispersion Models ◽  
Similarity Relations ◽  
Fuzzy Similarity

Fuzzy Similarity Relations in Decision Making

2020 ◽  
pp. 369-385 ◽  
Author(s):  
Mohamed El Alaoui ◽  
Khalid El Yassini
Keyword(s):  
Decision Making ◽  
Human Knowledge ◽  
Similarity Relations ◽  
Fuzzy Similarity ◽  
Context Of Use

Similarity is an ambiguous term that can be interpreted differently depending on the context of use. In this chapter, the authors review some of its uses before focusing on decision making. Ignoring the uncertainty of human knowledge would be denying a major attribute. Thus, they linked it to the fuzzy context. However, even taking this aspect into consideration, the opinion itself must be relevant. Therefore, the more a decision is similar to other opinions, the more it is coherent. Hence, there is a need to measure the similarity between each couple of expressed opinions.

scholarly journals Logicality and Invariance

2008 ◽  
Vol 14 (1) ◽  
pp. 29-68 ◽  
Author(s):  
Denis Bonnay
Keyword(s):  
Similarity Relation ◽  
Necessary Condition ◽  
General Notion ◽  
Sufficient Condition ◽  
Logical Constants ◽  
Similarity Relations ◽  
Definition Of

AbstractThis paper deals with the problem of giving a principled characterization of the class of logical constants. According to the so-called Tarski–Sher thesis, an operation is logical iff it is invariant under permutation. In the model-theoretic tradition, this criterion has been widely accepted as giving a necessary condition for an operation to be logical. But it has been also widely criticized on the account that it counts too many operations as logical, failing thus to provide a sufficient condition.Our aim is to solve this problem of overgeneration by modifying the invariance criterion. We introduce a general notion of invariance under a similarity relation and present the connection between similarity relations and classes of invariant operations. The next task is to isolate a similarity relation well-suited for a definition of logicality. We argue that the standard arguments in favor of invariance under permutation, which rely on the generality and the formality of logic, should be modified. The revised arguments are shown to support an alternative to Tarski's criterion, according to which an operation is logical iff it is invariant under potential isomorphism.

A Modal Logic for Similarity Relations in Pawlak Knowledge Representation Systems

1991 ◽  
Vol 15 (1) ◽  
pp. 61-79
Author(s):  
Dimiter Vakarelov
Keyword(s):  
Modal Logic ◽  
Knowledge Representation ◽  
Finite Model ◽  
Model Property ◽  
Finite Model Property ◽  
First Order ◽  
Similarity Relations ◽  
Representation Systems ◽  
Knowledge Representation Systems

One of the main results of the paper is a characterization of certain kind similarity relations in Pawlak knowledge representation systems by means of first order sentences. As an application we obtain a complete finite axiomatization of the corresponding poly modal logic, called in the paper MLSim. It is proved that MLSim possesses finite model property and is decidable.

Sign in / Sign up

Export Citation Format

Share Document