On the Succinctness of Closure Operator Representations

From International Center for Computational Logic

Toggle side column

On the Succinctness of Closure Operator Representations

Sebastian RudolphSebastian Rudolph
On the Succinctness of Closure Operator Representations


Sebastian Rudolph
On the Succinctness of Closure Operator Representations
In Cynthia Vera Glodeanu, Mehdi Kaytoue, Christian Sacarea, eds., Proc. 12th International Conference on Formal Concept Analysis (ICFCA 2014), volume 8478 of LNCS, 15-36, June 2014. Springer
  • KurzfassungAbstract
    It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper, we consider these two representation types, as well as generalizations of them: extended implications and context families. We discuss the mutual succinctness of these four representations and the tractability of certain operations used to modify closure operators.
  • Bemerkung: Note: invited paper
  • Weitere Informationen unter:Other info: Link
  • Forschungsgruppe:Research Group: Computational Logic
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-07248-7_2.
@inproceedings{R2014,
  author    = {Sebastian Rudolph},
  title     = {On the Succinctness of Closure Operator Representations},
  editor    = {Cynthia Vera Glodeanu and Mehdi Kaytoue and Christian Sacarea},
  booktitle = {Proc. 12th International Conference on Formal Concept Analysis
               (ICFCA 2014)},
  series    = {LNCS},
  volume    = {8478},
  publisher = {Springer},
  year      = {2014},
  month     = {June},
  pages     = {15-36},
  doi       = {10.1007/978-3-319-07248-7_2}
}