AbstractWe consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads to a computational interpretation of the representable theory
In this paper we investigate identities satisfied by a class of algebras made of ternary co-relation...
Many important problems in computer science can be reduced to the problem of using a set of equation...
We study translations of dyadic first-order sentences into equalities between relational expressions...
We consider the representable equational theory of binary relations, in a language expressing compos...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
Families of binary relations are important interpretations of regular expressions, and the equivalen...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Binary relations are such a basic object that they appear in many places in mathematics and computer...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractRecent years have seen a growing interest towards algebraic structures that are able to expr...
A new characterization of relational database schemes in normal forms is given. This characterizatio...
AbstractThe relational model is extended to include nested structures. This extension is formalised ...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We establish the undecidability of representability and of finite representability as algebras of bi...
In this paper we investigate identities satisfied by a class of algebras made of ternary co-relation...
Many important problems in computer science can be reduced to the problem of using a set of equation...
We study translations of dyadic first-order sentences into equalities between relational expressions...
We consider the representable equational theory of binary relations, in a language expressing compos...
Relation algebras are Boolean algebras with additional operations that generalize sets of binary rel...
Families of binary relations are important interpretations of regular expressions, and the equivalen...
Recent years have seen a growing interest towards algebraic structures that are able to express form...
Recently there has been a growing interest towards algebraic structures that are able to express for...
Binary relations are such a basic object that they appear in many places in mathematics and computer...
Relational reasoning is concerned with relations over an unspecified domain of discourse. Two limita...
AbstractRecent years have seen a growing interest towards algebraic structures that are able to expr...
A new characterization of relational database schemes in normal forms is given. This characterizatio...
AbstractThe relational model is extended to include nested structures. This extension is formalised ...
We consider nested relations whose schemes are structured as trees, called scheme trees, and introdu...
We establish the undecidability of representability and of finite representability as algebras of bi...
In this paper we investigate identities satisfied by a class of algebras made of ternary co-relation...
Many important problems in computer science can be reduced to the problem of using a set of equation...
We study translations of dyadic first-order sentences into equalities between relational expressions...
DOI
Add to ORKG