Published: 2012 Mai
Herausgeber: Florent Domenach, Dmitry I. Ignatov, Jonas Poelmans
Buchtitel: Proceedings of the 10th International Conference on Formal Concept Analysis
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 survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational or a black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by adding closed sets or implication, and conversion from one representation into another.