Fast Computation of Proper Premises

  title={Fast Computation of Proper Premises},
  author={Uwe Ryssel and Felix Distel and Daniel Borchmann},
This work is motivated by an application related to refactoring of model variants. In this application an implicational base needs to be computed, and runtime is more crucial than minimal cardinality. Since the usual stem base algorithms have proven to be too costly in terms of runtime, we have developed a new algorithm for the fast computation of proper premises. It is based on a known link between proper premises and minimal hypergraph transversals. Two further improvements are made, which… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
12 Extracted Citations
19 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 19 references

Expected numbers of proper premises and concept intents

  • Felix Distel, Daniel Borchmann
  • Preprint, Institut für Algebra, TU Dresden,
  • 2011
1 Excerpt

Fredman and Leonid Khachiyan . On the complexity of dualization of monotone disjunctive normal forms

  • L. Michael
  • Journal of Algorithms
  • 2003

Similar Papers

Loading similar papers…