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
Postprint
Statistics
Additional Services
| Author: | Bernhard MöllerGND, Georg StruthGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-592054 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/59205 |
| ISBN: | 978-3-540-22145-6OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Place of publication: | Berlin |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2004 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2019/09/04 |
| Volume: | 3051 |
| First Page: | 202 |
| Last Page: | 214 |
| DOI: | https://doi.org/10.1007/978-3-540-24771-5_18 |
| 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 |
