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. © 2011 Springer-Verlag.
CITATION STYLE
Ganter, B., Meschke, C., & Mühle, H. (2011). Merging ordered sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6628 LNAI, pp. 183–203). https://doi.org/10.1007/978-3-642-20514-9_15
Mendeley helps you to discover research relevant for your work.