Stepwise Construction of the Dedekind-MacNeille Completion

@inproceedings{Ganter1998StepwiseCO,
  title={Stepwise Construction of the Dedekind-MacNeille Completion},
  author={Bernhard Ganter and Sergei O. Kuznetsov},
  year={1998}
}
form a complete lattice, the D e d e k i n d M a c N e i l l e c o m p l e t i o n (or short comp l e t i o n ) of (P, <). It is the smallest complete lattice containing a subset orderisomorphic with (P, <). The size of the completion may be exponential in [PI. The completion can be computed in steps: first complete a small part of (P, <), then add another element, complete again, et cetera. Each such step increases the size of the completion only moderately and is moreover easy to perform. We… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

An Algorithm for Minimal Insertion in a Type Lattice

  • Petko Valtchev
  • Second International KRUSE Symposium, Vancouver,
  • 1997

Rampon : Computing On - Line the Lattice of Maximal Antichains of Posets

  • G.-V. Jourdan C. Jard, J.-X.
  • 1994

Endliche Verb ande { Diagramme und Eigenschaften

  • Martin Skorsky
  • 1992
1 Excerpt

Finite distributive lattices as concept lattices

  • Rudolf Wille
  • Atti Inc. Logica Math ematica, 2
  • 1985

Similar Papers

Loading similar papers…