... query language can be described in terms of the “information” that can be deduced fromaK-relation using queries in that query language. Following Paredaens [18] we define: Let Q be a query language ... of a query Q inRA+K(\,δ) such that Q (S5) = S3. Although the query constructed in the proof of Theorem 1 issuch a query, this query is by no means the unique (and most elegant) query ... semiringK. A query language, denoted by RA+K, similarto the classical positive relational algebra, allows for the querying ofK-relations. In thispaper, we define more expressive query languages...