The central result of this paper is that every pair-dense relation algebra is completely representable. A relation algebra is said to be pair-dense if every nonzero element below the identity contains ...

#RelEXParser A basic parser made in python, which can parse and process expressions written in relation algebra. The usefulness of relational algebra is that it is not database-query language specific ...

Abstract: We provide the calculus of relations as a data type implemented in an object-oriented Java-library, KURE. We demonstrate how to employ KURE in a CASE tool for the relation-algebraic analysis ...

This is a preview. Log in through your library . Abstract The standard model for mereotopological structures are Boolean subalgebras of the complete Boolean algebra ...

Abstract: Many graph query languages rely on composition to navigate graphs and select nodes of interest, even though evaluating compositions of relations can be costly. Often, this need for ...

FL-algebras are lattice-ordered algebras with two sets of residuated operators. The classes RA of relation algebras and GBI of generalized bunched implication algebras are subvarieties of FL-algebras.

We give a simple relation-algebraic semantics of read and write operations on associative arrays. The array operations seamlessly integrate with assignments in computation models supporting ...