Fast Computation of Proper Premises

Uwe RysselUwe Ryssel, Felix DistelFelix Distel, Daniel BorchmannDaniel Borchmann

Download

Uwe Ryssel, Felix Distel, Daniel Borchmann
Fast Computation of Proper Premises
In Amedeo Napoli and Vilem Vychodil, eds., International Conference on Concept Lattices and Their Applications, 101-113, 2011. INRIA Nancy – Grand Est and LORIA

Details
Bibtex

KurzfassungAbstract
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 reduce the number of proper premises that are obtained multiple times and redundancies within the set of proper premises. We provide heuristic evidence that an approach based on proper premises will also be beneficial for other applications.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ RyDiB11,
  author = {Uwe {Ryssel} and Felix {Distel} and Daniel {Borchmann}},
  booktitle = {International Conference on Concept Lattices and Their Applications},
  editor = {Amedeo {Napoli} and Vilem {Vychodil}},
  pages = {101--113},
  publisher = {INRIA Nancy -- Grand Est and LORIA},
  title = {Fast Computation of Proper Premises},
  year = {2011},
}