TY  - JOUR
A1  - Möller, Bernhard
A1  - Struth, Georg
T1  - Greedy-like algorithms in modal Kleene algebra
T2  - Lecture Notes in Computer Science
N2  - This study provides an algebraic background for the formal derivation of greedy-like algorithms. We propose Kleene algebra as a particularly simple alternative to previous approaches such as relation algebra. Instead of converse and residuation we use modal operators that are   definable in a wide class of algebras, based on domain/codomain or image/pre-image operations. By abstracting from earlier approaches we arrive at a very general theorem about the correctness of loops that covers particular forms of greedy algorithms as special cases.
Y1  - 2019
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/59205
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-592054
SN  - 978-3-540-22145-6
VL  - 3051
SP  - 202
EP  - 214
PB  - Springer
CY  - Berlin
ER  -