2011 | OriginalPaper | Buchkapitel
Merging Ordered Sets
verfasst von : Bernhard Ganter, Christian Meschke, Henri Mühle
Erschienen in: Formal Concept Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
While extending partial orders towards linear orders is a very well-researched topic, the combination of two ordered sets has not yet attracted too much attention. In the underlying article, however, we describe the possibilities to merge two given quasiordered sets in the sense that the restriction of the combined order towards the given ordered sets returns the initial orders again. It turns out that these
mergings
form a complete lattice. We elaborate these lattices of mergings and present its contextual representation. While the motivating example was discovered in role-oriented software modeling, we give a further possible application in the field of scheduling.