Direct-optimal basis computation by means of the fusion of simplification rules

DOI10.1016/j.dam.2017.12.031zbMath1398.68520OpenAlexW2795731851MaRDI QIDQ1800392

Pablo Cordero, Ángel Mora, Manuel Enciso, Karell Bertet, Estrella Rodríguez-Lorenzo

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.2017.12.031

zbMATH Keywords

closuredirect-optimal basissimplification logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (5)

Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ Quasi-closed elements in fuzzy posets ⋮ Interactive search by using minimal generators

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The joy of implications, aka pure Horn formulas: mainly a survey
• The multiple facets of the canonical direct unit implicational basis
• Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
• Complexity of learning in concept lattices from positive and negative examples
• Ordered direct implicational basis of a finite closure system
• Optimizations in computing the Duquenne-Guigues basis of implications
• Fast algorithms for implication bases and attribute exploration using proper premises
• Some Notes on Managing Closure Operators
• Closure via functional dependence simplification
• Formal Concept Analysis

This page was built for publication: Direct-optimal basis computation by means of the fusion of simplification rules