Search

We show that the matrix query language MATLANG corresponds to a natural fragment of the positive relational algebra on K-relations. The fragment is defined by introducing a composition operator and restricting K-relation arities to 2. We then proceed to show that MATLANG can express all matrix queries expressible in the positive relational algebra on K-relations, when intermediate arities are restricted to 3. Thus we offer an analogue, in a model with numerical data, to the situation in classical logic, where the algebra of binary relations is equivalent to first-order logic with three variables. [ABSTRACT FROM AUTHOR]

We present a procedure that allows the abstraction of elements in concrete symbolic matrices to obtain a more compact representation employing ellipses in order to expose homogeneous regions present in a matrix. We furthermore extend that procedure to allow for generalisations of concrete matrices to an abstract form that enables us to determine the generic type of a given matrix. The presented algorithms employ artificial intelligence techniques such as pattern recognition and constraint solving. [ABSTRACT FROM AUTHOR]