Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
We combine relational algebra and program derivation methodology and reconstruct a proof of Richardson's theorem that every finite directed graph without circuits of odd length has a kernel as a relational program. Also a generalization of the approach is presented. (C) 2000 Elsevier Science B.V. All rights reserved.
relational programming kernels relational algebra program derivation directed graphs