Any monotone Boolean function on a lattice can be described by the set of its minimal 1 values. If a lattice is given as a concept lattice, this set can be represented by the set of minimal hypotheses of a classification context. Enumeration of minimal hypotheses in output polynomial time is shown to be impossible unless P = NP, which shows that dualization of monotone functions on lattices with quasipolynomial delay is hardly possible. © 2011 Springer-Verlag.
CITATION STYLE
Babin, M. A., & Kuznetsov, S. O. (2011). Enumerating minimal hypotheses and dualizing monotone Boolean functions on lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6628 LNAI, pp. 42–48). https://doi.org/10.1007/978-3-642-20514-9_5
Mendeley helps you to discover research relevant for your work.