On the representation of roles in object-oriented and conceptual modelling
Data & Knowledge Engineering
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Lattices of rough set abstractions as P-products
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Approximations in concept lattices
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
The tensor product as a lattice of regular galois connections
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
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.