Add to ORKGWe define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that are well suited to the representation of heterogeneous data, irrespective of whether the data originated from relational, unstructured, semi-structured or structured sources. This higher-order generalisation of the relational model ha
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
AbstractThe term-generated models of an abstract data type can be represented by congruence relation...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
We study an approach to relational databases which treats relations not as subsets of a Cartesian pr...
[[abstract]]In this paper, we propose an extended relational model to accommodate exclusive-or disju...
A generalised relational data model is formalised for the representation of data with nested structu...
This paper presents an application of relation algebra to lexical databases. The semantics of knowle...
SIGLETIB: RO 3316 (1984,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Information...
We present a generalisation of the relational data model based on a 4-valued paraconsistent logic. O...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
AbstractThe term-generated models of an abstract data type can be represented by congruence relation...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
Homogeneous relation algebra is an elegant calculational framework with many applications in computi...
We study an approach to relational databases which treats relations not as subsets of a Cartesian pr...
[[abstract]]In this paper, we propose an extended relational model to accommodate exclusive-or disju...
A generalised relational data model is formalised for the representation of data with nested structu...
This paper presents an application of relation algebra to lexical databases. The semantics of knowle...
SIGLETIB: RO 3316 (1984,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Information...
We present a generalisation of the relational data model based on a 4-valued paraconsistent logic. O...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
International audienceIn this paper, an algebra A consisting of first order logic operators has been...
AbstractThe term-generated models of an abstract data type can be represented by congruence relation...