Relational computation of sets of relations

DOI10.1007/978-3-030-88701-8_4MaRDI QIDQ2695345zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer

Publication date 30 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-88701-8_4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 868090 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• Column-wise extendible vector expressions and the relational computation of sets of sets
• Evaluating Sets of Search Points Using Relational Algebra
• Multirelations with infinite computations
• On the Cardinality of Relations
• Programs as partial graphs. I: Flow equivalence and correctness
• Relation-algebraic specification and solution of special university timetabling problems
• Relational algebraic semantics of deterministic and nondeterministic programs
• Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces

Cited in

(6)

• Computational methods for set-relation-based scalarizing functions
• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• Computing the reveals relation in occurrence nets
• A general method for representing sets of relations by vectors
• Relational programming laws in the tree, list, bag, set hierarchy
• scientific article; zbMATH DE number 1795210 (Why is no real title available?)

This page was built for publication: Relational computation of sets of relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695345)