Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem

DOI10.1016/S0167-6423(99)00043-XMaRDI QIDQ1581059zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer, Thorsten Hoffmann

Publication date 14 September 2000

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6423(99)00043-x

zbMATH Keywords

finite directed graphrelational program

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• scientific article; zbMATH DE number 177458
• scientific article; zbMATH DE number 890353
• scientific article; zbMATH DE number 2063843
• Relational programming laws in the tree, list, bag, set hierarchy

Cited in

(6)

• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Experimental investigation of sufficient criteria for relations to have kernels
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Applying relational algebra and REL VIEW to coalition formation
• Applying relation algebra and RelView to solve problems on orders and lattices

Describes a project that uses

Uses Software

• RelView

This page was built for publication: Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem

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