scientific article; zbMATH DE number 7635224
From MaRDI portal
Publication:5058462
zbMath1504.68217MaRDI QIDQ5058462
J. L. Guigues, Vincent Duquenne
Publication date: 20 December 2022
Full work available at URL: https://eudml.org/doc/94331
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Three views on dependency covers from an FCA perspective ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ Self-adhesivity in lattices of abstract conditional independence models ⋮ Explaining data with formal concept analysis ⋮ Learning Horn envelopes via queries from language models ⋮ Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group ⋮ Representations of uncertainty in artificial intelligence: probability and possibility ⋮ Formal concept analysis: from knowledge discovery to knowledge processing ⋮ Extracting attribute implications from a formal context: unifying the basic approaches ⋮ The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Computing sets of graded attribute implications with witnessed non-redundancy ⋮ Complexity of learning in concept lattices from positive and negative examples ⋮ Logic of temporal attribute implications ⋮ A calculus for containment of fuzzy attributes ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Comparison of reduction in formal decision contexts ⋮ Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Computing Dependencies Using FCA ⋮ Scalable Visual Analytics in FCA ⋮ Formal Methods in FCA and Big Data ⋮ Minimum implicational basis for \(\wedge\)-semidistributive lattices ⋮ Notes on join semidistributive lattices ⋮ Knowledge cores in large formal contexts ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Optimum basis of finite convex geometry ⋮ Horn axiomatizations for sequential data ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Learning a propagation complete formula ⋮ Directed hypergraphs and Horn minimization ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Unique key Horn functions ⋮ Axiomatisation of general concept inclusions from finite interpretations ⋮ Attribute exploration with multiple contradicting partial experts ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Inference engine based on closure and join operators over truth table binary relations ⋮ Representations for the largest extension of a closure system ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Formal concept analysis approach to understand digital evidence relationships ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Construction and learnability of canonical Horn formulas ⋮ Interactive error correction in implicative theories ⋮ On the complexity of enumerating pseudo-intents ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Closure-based constraints in formal concept analysis ⋮ Generating clause sequences of a CNF formula ⋮ The core of finite lattices ⋮ Bounds on the size of PC and URC formulas ⋮ Organization by rules in finite sequences ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ Dualization in lattices given by ordered sets of irreducibles ⋮ Succinctness and tractability of closure operator representations ⋮ Learning definite Horn formulas from closure queries ⋮ RQL: a query language for rule discovery in databases ⋮ Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics ⋮ Hydras: directed hypergraphs and Horn formulas ⋮ On sets of graded attribute implications with witnessed non-redundancy ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Fast algorithms for implication bases and attribute exploration using proper premises ⋮ On minimal sets of graded attribute implications ⋮ Concept lattices and conceptual knowledge systems ⋮ Fuzzy logic programming reduced to reasoning with attribute implications ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ A compact representation for modular semilattices and its applications ⋮ Pseudo-models and propositional Horn inference ⋮ Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors ⋮ Valuations and closure operators on finite lattices ⋮ Generalized domination in closure systems ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Minimal bases of temporal attribute implications ⋮ Acquiring Generalized Domain-Range Restrictions ⋮ A Finite Basis for the Set of $\mathcal{EL}$ -Implications Holding in a Finite Model ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the Merge of Factor Canonical Bases ⋮ Concept lattices with negative information: a characterization theorem ⋮ Canonical dichotomous direct bases ⋮ Derivation digraphs for dependencies in ordinal and similarity-based data ⋮ Translating between the representations of a ranked convex geometry ⋮ On implication bases in \(n\)-lattices ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions ⋮ Graded LinClosure and Its Role in Relational Data Analysis ⋮ Towards Concise Representation for Taxonomies of Epistemic Communities ⋮ A depth-first search algorithm for computing pseudo-closed sets ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Decision implication canonical basis: a logical perspective ⋮ Closed-Set-Based Discovery of Representative Association Rules ⋮ Far beyond the classical data models: symbolic data analysis ⋮ Quasi-closed elements in fuzzy posets ⋮ Attribute exploration with background knowledge ⋮ Latticial structures in data analysis. ⋮ Steps towards causal Formal Concept Analysis
This page was built for publication:
