Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets
verfasst von : Rudolf Berghammer
Erschienen in: Mathematics of Program Construction
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
We present a technique for the relational computation of sets of sets. It is based on specific vector expressions, which form the syntactical counterparts of B. Kehden’s vector predicates. Compared with the technique that directly solves a posed problem by the development of a vector expression of type \({2^X}\,\leftrightarrow \,{\mathbf{1}\!\!\!\mathbf{1}}\) from a formal logical problem description, we reduce the solution to the development of inclusions between vector expressions of type \({X}\,\leftrightarrow \,{\mathbf{1}\!\!\!\mathbf{1}}\). Frequently, this is a lot simpler. The transition from the inclusions to the desired vector expression of type \({2^X}\,\leftrightarrow \,{\mathbf{1}\!\!\!\mathbf{1}}\) is then immediately possible by means of a general result. We apply the technique to some examples from different areas and show how the solutions behave with regard to running time if implemented and evaluated by the Kiel RelView tool.