Attribute-incremental construction of the canonical implication basis

DOI10.1007/s10472-007-9057-2zbMath1125.68121WikidataQ62046337 ScholiaQ62046337MaRDI QIDQ2385433

Sergei Obiedkov, Vincent Duquenne

Publication date: 12 October 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-007-9057-2

zbMATH Keywords

Galois lattice; Duquenne-Guigues basis; Incremental algorithm; Implication; Formal concept analysis

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68T30: Knowledge representation

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

On the complexity of enumerating pseudo-intents, Decision implication canonical basis: a logical perspective, Optimizations in computing the Duquenne-Guigues basis of implications, Fast algorithms for implication bases and attribute exploration using proper premises, Some Complexity Results about Essential Closed Sets

Uses Software

• AddIntent
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of finite closure spaces based on implications
• On the irredundant generation of knowledge spaces
• Minimal Representation of Directed Hypergraphs
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices