scientific article; zbMATH DE number 2159643

MaRDI QIDQ4667609zbMATH OpenFDO

Authors Karell Bertet, Mirabelle Nebut

Publication date 20 April 2005

Full work available at URL https://eudml.org/doc/124603, http://www.emis.de/journals/DMTCS/volumes/abstracts/dm060209.abs.html

zbMATH Keywords

algorithmsclosure operatorimplicational systemlatticeMoore familyordered set

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Database theory (68P15) Nonnumerical algorithms (68W05)

Recommendations

• Formal Concept Analysis
• Some Notes on Managing Closure Operators
• Canonical dichotomous direct bases
• Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
• Finite hull systems and their implication bases.

Cited in

(16)

• The presence of lattice theory in discrete problems of mathematical social sciences. Why.
• Finite hull systems and their implication bases.
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Direct-optimal basis computation by means of the fusion of simplification rules
• Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
• Canonical dichotomous direct bases
• Canonicity!
• Canonical Inference for Implicational Systems
• Two basic algorithms in concept analysis
• Characterizing Implications of Injective Partial Orders
• Canonical ground Horn theories
• On the succinctness of closure operator representations
• Formal Methods in FCA and Big Data
• Succinctness and tractability of closure operator representations
• Formal Concept Analysis
• The multiple facets of the canonical direct unit implicational basis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667609)