Greedy-like algorithms in modal Kleene algebra

  • 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.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Bernhard MöllerGND, Georg StruthGND
Frontdoor URL
Parent Title (English):Lecture Notes in Computer Science
Place of publication:Berlin
Year of first Publication:2004
Publishing Institution:Universität Augsburg
Release Date:2019/09/04
First Page:202
Last Page:214
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht