Dualization in lattices given by ordered sets of irreducibles

DOI10.1016/j.tcs.2016.01.005zbMath1356.68225arXiv1504.01145OpenAlexW2963150415MaRDI QIDQ507520

Sergei O. Kuznetsov, Mikhail A. Babin

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01145

zbMATH Keywords

distributive latticeformal concept analysismonotone Boolean dualization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Knowledge representation (68T30) Complete lattices, completions (06B23) Boolean functions (06E30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (6)

On Dualization over Distributive Lattices ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ On the dualization in distributive lattices and related problems ⋮ Translating between the representations of a ranked convex geometry ⋮ Dualization in lattices given by implicational bases ⋮ Enumerating maximal consistent closed sets in closure systems

Cites Work

• Generating all maximal models of a Boolean expression
• Mathematical aspects of concept analysis
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Computational aspects of monotone dualization: a brief survey
• Structure identification in relational data
• Complexity of learning in concept lattices from positive and negative examples
• The relative complexity of approximate counting problems
• Lattice Theory: Foundation
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Algorithms for Dualization over Products of Partially Ordered Sets
• Conceptual Structures for Knowledge Creation and Communication
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dualization in lattices given by ordered sets of irreducibles