Results 201 to 210 of about 614,069 (238)

Transformation of binary relations

Proceedings of the Sixth International Conference on Computer Supported Cooperative Work in Design (IEEE Cat. No.01EX472), 2002
In the object-oriented paradigm, as complexity rises, the cost of developing and maintaining software systems grows exponentially. This complexity emerges from the continuous evolution of software systems to cope with changing requirements. This crucial problem can be dealt with by performing an active transformation of the elements (i.e.
Jamal Said, Eric Steegmans
openaire   +1 more source

Binary Relations and Permutation Groups

Mathematical Logic Quarterly, 1995
AbstractWe discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed
Hajnal Andréka, Ivo Düntsch, István Németi   +2 more
openaire   +2 more sources

On the Compatibility of a Ternary Relation with a Binary Fuzzy Relation

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2019
Recently, De Baets et al. have characterized the fuzzy tolerance relations that a given strict order relation is compatible with. In general, the compatibility of a strict order relation with a binary fuzzy relation guarantees also the compatibility of its associated betweenness relation with that binary fuzzy relation.
Omar Barkat, Lemnaouar Zedam, Bernard De Baets   +2 more
openaire   +1 more source

Subgroups of Binary Relations

1974
A binary relation defined on a set containing n elements can be interpreted as an n × n incidence matrix. Such matrix may be taken either over the two element boolean algebra or over the field Z2 . The main purpose of this paper is to study the incidence subgroups and the collineation subgroups of semigroups of binary relations.
openaire   +1 more source

On a binary relation inference network

[1991] Proceedings. The Fifth International Parallel Processing Symposium, 2002
Many human and machine reasoning tasks require complicated inferences between objects and events, in which the constituting inference processes depend in turn on successive inferences on more basic binary relations. Given a set of n binary relations between m different objects or events, it is possible to infer other consistent binary relations, to ...
Kai-Pui Lam, Crystal J. Su
openaire   +1 more source

STRUCTURE OF FUZZY BINARY RELATIONS

Fuzzy Sets and Systems, 1981
The structure of fuzzy binary relations of indifference and preference is studied. The full description of fuzzy equivalence relations in terms of fuzzy partitions is given. All possible logical relations between various transitivity properties of fuzzy preferences are established.
openaire   +2 more sources

Clonal sets of a binary relation

International Journal of General Systems, 2018
AbstractIn a recent paper, we have introduced the notion of clone relation of a given binary relation. Intuitively, two elements are said to be “clones” if they are related in the same way w.r.t.
Lemnaouar Zedam, Raúl Pérez-Fernández, Hassane Bouremel, Bernard De Baets   +3 more
openaire   +1 more source

Complete Semigroups of Binary Relations

Journal of Mathematical Sciences, 2003
This paper considers the subgroups of the semigroup of binary relations \(B_X\) consisting of binary relations \(R\) whose sections \(S_x=\{y\mid(x,y)\in R\}\) are always members of a complete semilattice \(D\) of subsets of \(X\) under union. These semigroups can also be studied in terms of Boolean matrices and have applications to graph theory ...
openaire   +1 more source

An algebraic approach to binary relations

Asian-European Journal of Mathematics, 2015
Several attempts were made to assign to a given binary relation a certain binary operation in order to allow an algebraic approach for investigating binary relations. However, the previous attempts by the first two authors were restricted to the case of so-called directed binary relations.
Chajda, Ivan, Länger, Helmut, Ševčik, Petr   +2 more
openaire   +1 more source

The second calculus of binary relations

1993
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to K-valued binary relations, which for K=2n we show generalize n-ary relational structures.
openaire   +1 more source