A Generalized Next-Closure Algorithm — Enumerating Semilattice Elements from a Generating Set

Aus International Center for Computational Logic
Version vom 26. September 2016, 14:36 Uhr von Daniel Borchmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Daniel |ErsterAutorNachname=Borchmann }} {{Inproceedings |Referiert=1 |Title=A Generalized Next-Closure Algorith…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

A Generalized Next-Closure Algorithm — Enumerating Semilattice Elements from a Generating Set

Daniel BorchmannDaniel Borchmann
Daniel Borchmann
A Generalized Next-Closure Algorithm — Enumerating Semilattice Elements from a Generating Set
In Laszlo Szathmary, Uta Priss, eds., Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, volume 972 of CEUR Workshop Proceedings, 9-20, October 2012
@inproceedings{B2012,
  author    = {Daniel Borchmann},
  title     = {A Generalized Next-Closure Algorithm {\textemdash} Enumerating
               Semilattice Elements from a Generating Set},
  editor    = {Laszlo Szathmary and Uta Priss},
  booktitle = {Proceedings of The Ninth International Conference on Concept
               Lattices and Their Applications},
  series    = {CEUR Workshop Proceedings},
  volume    = {972},
  year      = {2012},
  month     = {October},
  pages     = {9-20}
}