摘要 :
In a recent paper, De Baets et al. have characterized the fuzzy tolerance and fuzzy equivalence relations that a given strict order relation is compatible with. In this paper, we generalize this characterization by considering an ...
展开
In a recent paper, De Baets et al. have characterized the fuzzy tolerance and fuzzy equivalence relations that a given strict order relation is compatible with. In this paper, we generalize this characterization by considering an arbitrary (crisp) relation instead of a strict order relation, while paying attention to the particular cases of a reflexive or irreflexive relation. The reasoning largely draws upon the notion of the clone relation of a (crisp) relation, introduced recently by Bouremel et al., and the partition of this clone relation in terms of three different types of pairs of clones. More specifically, reflexive related clones and irreflexive unrelated clones turn out to play a key role in the characterization of the fuzzy tolerance and fuzzy equivalence relations that a given (crisp) relation is compatible with.
收起
摘要 :
We show that although there exists no non-trivial (fuzzy) tolerance relation a partial order relation is compatible with (in the sense of Bclohlavck), the situation is quite different when considering its strict part. More specifi...
展开
We show that although there exists no non-trivial (fuzzy) tolerance relation a partial order relation is compatible with (in the sense of Bclohlavck), the situation is quite different when considering its strict part. More specifically, we provide a representation of all fuzzy tolerance (and, in particular, all fuzzy equivalence) relations a strict order relation is compatible with. To that end, we introduce the notion of clone relation associated with a partially ordered set and discuss its basic properties. The mentioned representation is intimately connected with this clone relation. (C) 2015 Elsevier B.V. All rights reserved.
收起
摘要 :
Extracting semantic relations from text is a preliminary step towards understanding the meaning of text. The more semantic relations are extracted from a sentence, the better the representation of the knowledge encoded into that s...
展开
Extracting semantic relations from text is a preliminary step towards understanding the meaning of text. The more semantic relations are extracted from a sentence, the better the representation of the knowledge encoded into that sentence. This article introduces a framework for the Composition of Semantic Relations (CSR). CSR aims to reveal more text semantics than existing semantic parsers by composing new relations out of previously extracted relations. Semantic relations are defined using vectors of semantic primitives, and an algebra is suggested to manipulate these vectors according to a CSR algorithm. Inference axioms that combine two relations and yield another relation are generated automatically. CSR is a language-agnostic, inventory-independent method to extract semantic relations. The formalism has been applied to a set of 26 well-known relations and results are reported.
收起
摘要 :
In this paper, we introduce six basic types of composition of ternary relations, four of which are associative. These compositions are based on two types of composition of a ternary relation with a binary relation recently introdu...
展开
In this paper, we introduce six basic types of composition of ternary relations, four of which are associative. These compositions are based on two types of composition of a ternary relation with a binary relation recently introduced by Zedam et al. We study the properties of these compositions, in particular the link with the usual composition of binary relations through the use of the operations of projection and cylindrical extension.
收起
摘要 :
In this paper we study presentations of finite simple groups G from a quantitative point of view. Our main result provides unexpected answers to the following questions: how many relations are needed to define G, and how short can...
展开
In this paper we study presentations of finite simple groups G from a quantitative point of view. Our main result provides unexpected answers to the following questions: how many relations are needed to define G, and how short can these relations be?
收起
摘要 :
In a recent paper, De Baets et al. introduced the clone relation of a strict order relation. Two elements of a poset are said to be a pair of clones (or to be clones) if every other element that is greater (resp. smaller) than one...
展开
In a recent paper, De Baets et al. introduced the clone relation of a strict order relation. Two elements of a poset are said to be a pair of clones (or to be clones) if every other element that is greater (resp. smaller) than one of them is also greater (resp. smaller) than the other one. This clone relation played a key role in the characterization of the L-fuzzy tolerance relations and the L-fuzzy equivalence relations that a strict order relation is compatible with. In this paper, we extend the notion of clone relation to any binary relation. Although the definition of such extension is trivial, the corresponding properties significantly differ from those of the clone relation of a strict order relation. We analyse the most important ones among these properties, paying particular attention to a partition of the clone relation in terms of three different types of pairs of clones. (C) 2016 Elsevier Inc. All rights reserved.
收起
摘要 :
We propose a mathematical apparatus based on binary relations that expands the possibility of traditional analysis applied to problems in mathematical and theoretical physics. We illustrate the general constructions with examples ...
展开
We propose a mathematical apparatus based on binary relations that expands the possibility of traditional analysis applied to problems in mathematical and theoretical physics. We illustrate the general constructions with examples with an algebraic description of Backlund transformations of nonlinear systems of partial differential equations and the dynamics of wave packet propagation.
收起
摘要 :
We define relations and their composition in a category with (#epsilon#, M)-factorization structure, with M consisting of monomorphisms, but #epsilon# not restricted to epimorphisms. We obtain an associativity criterion for compos...
展开
We define relations and their composition in a category with (#epsilon#, M)-factorization structure, with M consisting of monomorphisms, but #epsilon# not restricted to epimorphisms. We obtain an associativity criterion for composition of relations, and we study functional and induced relations. We show that under our assumptions, the categories of relations on functional and induced relations are isomorphic to the category of relations for the given category.
收起
摘要 :
In this paper we investigate reachability relations on the vertices of digraphs. IfW is a walk in a digraph D, then the height of W is equal to the number of edgestraversed in the direction coinciding with their orientation, minus...
展开
In this paper we investigate reachability relations on the vertices of digraphs. IfW is a walk in a digraph D, then the height of W is equal to the number of edgestraversed in the direction coinciding with their orientation, minus the number ofedges traversed opposite to their orientation. Two vertices u, v E V(D) are Ra,b-related if there exists a walk of height 0 between u and v such that the height ofevery subwalk of W, starting at u, is contained in the interval [a, b], where a is anon-positive integer or a = and b is a non-negative integer or b = no. Of coursethe relations Ra,b are equivalence relations on V (D). Factorising digraphs by Ra,and R,b, respectively, we can only obtain a few different digraphs. Dependingupon these factor graphs with respect to R,b and Ra, it is possible to definefive different "basic relation-properties for R,b and Ra,, respectively. Besides proving general properties of the relations Ra,b, we investigate the ques-tion which of the "basic relation-properties" with respect to R,b and Ra, canoccur simultaneously in locally finite connected transitive digraphs. Furthermorewe investigate these properties for some particular subclasses of locally finite con-nected transitive digraphs such as Cayley digraphs, digraphs with one, with two orwith infinitely many ends, digraphs containing or not containing certain directedsubtrees, and highly arc transitive digraphs.
收起