Towards antichain algebra
- We use an algebra of preference strict-orders to give a formal derivation of the standard Block-Nested Loop (BNL) algorithm for computing the best or maximal objects w.r.t. such an order. This derivation is presented in terms of antichains, i.e., sets of mutually incomparable objects. We define an approximation relation between antichains that reflects the steps taken by the BNL algorithm. This induces a semilattice and the operator computing the maximal objects of a subset can be viewed as a closure operator in an associated pre-ordered set and hence yields a characterisation of antichains in terms of a Galois connection.
Download full text files
Postprint
Statistics
Additional Services
| Author: | Bernhard MöllerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-587347 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/58734 |
| ISBN: | 9783319247038OPAC |
| ISBN: | 9783319247045OPAC |
| ISSN: | 0302-9743OPAC |
| ISSN: | 1611-3349OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer International |
| Place of publication: | Cham |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2015 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2019/07/23 |
| Volume: | 9348 |
| First Page: | 344 |
| Last Page: | 361 |
| DOI: | https://doi.org/10.1007/978-3-319-24704-5_21 |
| 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 |
