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 ...

This Coq development is a modular library about relation algebra: those algebras admitting heterogeneous binary relations as a model, ranging from partially ordered monoid to residuated Kleene ...

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 ...

#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 ...

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