A depth-first search algorithm for computing pseudo-closed sets

DOI10.1016/j.dam.2018.03.030zbMath1397.05013OpenAlexW2786028510MaRDI QIDQ1800382

Alexandre Bazin

Publication date: 23 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.030

zbMATH Keywords

implicationpseudo-closed set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for \(k\)-meet-semidistributive lattices
• On the complexity of enumerating pseudo-intents
• Minimum implicational basis for \(\wedge\)-semidistributive lattices
• The multiple facets of the canonical direct unit implicational basis
• The core of finite lattices
• Finding all closed sets: A general approach
• Computing premises of a minimal cover of functional dependencies is intractable
• Attribute-incremental construction of the canonical implication basis
• Computing the Duquenne–Guigues basis: an algorithm for choosing the order
• Optimal implicational bases for finite modular lattices
• Formal Concept Analysis
• Formal Concept Analysis

This page was built for publication: A depth-first search algorithm for computing pseudo-closed sets