Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
From MaRDI portal
Publication:1581059
DOI10.1016/S0167-6423(99)00043-XzbMath0957.68029OpenAlexW2041921559MaRDI QIDQ1581059
Thorsten Hoffmann, Rudolf Berghammer
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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Applying relational algebra and REL VIEW to coalition formation ⋮ Experimental investigation of sufficient criteria for relations to have kernels ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
Uses Software
This page was built for publication: Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
