Lattices, closures systems and implication bases: a survey of structural aspects and algorithms

DOI10.1016/J.TCS.2016.11.021zbMATH Open1398.68510OpenAlexW2558796058MaRDI QIDQ1659991FDOQ1659991

Karell Bertet, Jean-François Viaud, Christophe Demko, Clément Guérin

Publication date: 23 August 2018

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.021

zbMATH Keywords

latticeconcept latticeclosure systemcanonical basisclosure operatorminimal generatorsGalois latticedependence graphimplicational systemclosed set latticecanonical direct basis

Mathematics Subject Classification ID

Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Structure theory of lattices (06B05) Representation theory of lattices (06B15) Complete lattices, completions (06B23)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An open graph visualization system and its applications to software engineering
• Comparing performance of algorithms for generating concept lattices
• Galois Connexions
• Lattice Theory: Foundation
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Computing the minimum cover of functional dependencies
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• The multiple facets of the canonical direct unit implicational basis
• Two Basic Algorithms in Concept Analysis
• Finite ordered sets. Concepts, results and applications
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• A fast algorithm for building lattices
• An approach to lattice varieties of finite height
• Ordered direct implicational basis of a finite closure system
• Fast algorithms for implication bases and attribute exploration using proper premises
• On the complexity of enumerating pseudo-intents
• Arrowian characterizations of latticial federation consensus functions
• Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
• Functional dependencies in Horn theories
• Simplicial elimination schemes, extremal lattices and maximal antichain lattices
• Introduction to logical information systems

Cited In (15)

• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• On the relation between the subadditivity cone and the quantum entropy cone
• Dualization in lattices given by implicational bases
• Comparing machine learning algorithms by union-free generic depth
• Three views on dependency covers from an FCA perspective
• \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
• Lattice point of view for argumentation framework
• Translating between the representations of a ranked convex geometry
• Enumerating maximal consistent closed sets in closure systems
• On Dualization over Distributive Lattices
• Direct-optimal basis computation by means of the fusion of simplification rules
• Quasi-closed elements in fuzzy posets
• Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
• The joy of implications, aka pure Horn formulas: mainly a survey

Uses Software

• Galicia
• IGLUE
• Concept Explorer

Recommendations

• On implication bases in \(n\)-lattices 👍 👎
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey 👍 👎
• A Lattice of Implicative Extensions of Regular Kleene's Logics 👍 👎
• Bases of closure systems over residuated lattices 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Lattices, closures systems and implication bases: a survey of structural aspects and algorithms

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