Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
type: Item
instance of: scholarly article
title: Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
zbMATH Open document ID: 1398.68510
author: Karell Bertet
author: Christophe Demko
author: Jean-François Viaud
author: Clément Guérin
published in: Theoretical Computer Science
publication date: 2018-08-23T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 06A15
Mathematics Subject Classification ID: 06B05
Mathematics Subject Classification ID: 06B15
Mathematics Subject Classification ID: 06B23
zbMATH DE Number: 6923892
zbMATH Keywords: lattice
zbMATH Keywords: closed set lattice
zbMATH Keywords: concept lattice
zbMATH Keywords: Galois lattice
zbMATH Keywords: implicational system
zbMATH Keywords: closure operator
zbMATH Keywords: closure system
zbMATH Keywords: canonical direct basis
zbMATH Keywords: canonical basis
zbMATH Keywords: dependence graph
zbMATH Keywords: minimal generators
describes a project that uses: Concept Explorer
describes a project that uses: Galicia
describes a project that uses: IGLUE
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.11.021
OpenAlex ID: W2558796058
cites work: Q4165427
cites work: Lattice Theory: Foundation
cites work: Finite ordered sets. Concepts, results and applications
cites work: Q5685119
cites work: Q4055674
cites work: Galois Connexions
cites work: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
cites work: Q3952147
cites work: Q4230685
cites work: Introduction to logical information systems
cites work: Simplicial elimination schemes, extremal lattices and maximal antichain lattices
cites work: Arrowian characterizations of latticial federation consensus functions
cites work: Q4834373
cites work: An approach to lattice varieties of finite height
cites work: Q4149496
cites work: Ordered direct implicational basis of a finite closure system
cites work: Q5058462
cites work: The multiple facets of the canonical direct unit implicational basis
cites work: Q3149779
cites work: Q4195940
cites work: Q4170725
cites work: Two Basic Algorithms in Concept Analysis
cites work: Q3029054
cites work: A fast algorithm for building lattices
cites work: Comparing performance of algorithms for generating concept lattices
cites work: Computing the minimum cover of functional dependencies
cites work: THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
cites work: On the complexity of enumerating pseudo-intents
cites work: Q4667609
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
cites work: Functional dependencies in Horn theories
cites work: Q4023862
cites work: Fast algorithms for implication bases and attribute exploration using proper premises
cites work: An open graph visualization system and its applications to software engineering
DOI: 10.1016/J.TCS.2016.11.021
Recommended article: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
Recommended article: On implication bases in \(n\)-lattices
Recommended article: Q4825839
Recommended article: Q4237708
Recommended article: Q4032849
Recommended article: Bases of closure systems over residuated lattices
Recommended article: Q4704397
Recommended article: Q3148081
Recommended article: Q5397230
Recommended article: A Lattice of Implicative Extensions of Regular Kleene's Logics