scientific article; zbMATH DE number 5216731
From MaRDI portal
Publication:5429564
zbMath1277.68258MaRDI QIDQ5429564
Publication date: 30 November 2007
Full work available at URL: http://www.jucs.org/jucs_10_8/on_the_intractability_of
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (25)
Formal Methods in FCA and Big Data ⋮ Knowledge cores in large formal contexts ⋮ Attribute-incremental construction of the canonical implication basis ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Interactive error correction in implicative theories ⋮ On the complexity of enumerating pseudo-intents ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Machine learning with probabilistic law discovery: a concise introduction ⋮ Closure-based constraints in formal concept analysis ⋮ Some Complexity Results about Essential Closed Sets ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ Succinctness and tractability of closure operator representations ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ Probabilistic generalization of formal concepts ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On implication bases in \(n\)-lattices ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ Decision implication canonical basis: a logical perspective ⋮ Steps towards causal Formal Concept Analysis ⋮ Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis ⋮ Approximate computation of exact association rules
This page was built for publication:
