Merging ordered sets

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionContributedpeer-review

Contributors

  • Bernhard Ganter - , Institute of Algebra (Author)
  • Christian Meschke - , TUD Dresden University of Technology (Author)
  • Henri Mühle - , University of Vienna (Author)

Abstract

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.

Details

Original languageEnglish
Title of host publicationFormal Concept Analysis
EditorsPetko Valtchev, Robert Jäschke
Pages183-203
Number of pages21
Publication statusPublished - 2011
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6628 LNAI
ISSN0302-9743

Conference

Title9th International Conference on Formal Concept Analysis, ICFCA 2011
Duration2 - 6 May 2011
CityNicosia
CountryCyprus

Keywords