The following pages link to (Q5058462):
Displaying 50 items.
- Inference engine based on closure and join operators over truth table binary relations (Q406448) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- RQL: a query language for rule discovery in databases (Q507529) (← links)
- Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics (Q507531) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- On minimal sets of graded attribute implications (Q526697) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Minimal bases of temporal attribute implications (Q722104) (← links)
- Derivation digraphs for dependencies in ordinal and similarity-based data (Q726160) (← links)
- On implicational bases of closure systems with unique critical sets. (Q741717) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- Minimum implicational basis for \(\wedge\)-semidistributive lattices (Q845722) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- Interactive error correction in implicative theories (Q899138) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- The core of finite lattices (Q1176723) (← links)
- Organization by rules in finite sequences (Q1184255) (← links)
- Concept lattices and conceptual knowledge systems (Q1202663) (← links)
- Attribute exploration with background knowledge (Q1285777) (← links)
- Latticial structures in data analysis. (Q1285785) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Closure systems and their structure (Q1602560) (← links)
- Implicative analysis for multivariate binary data using an imprecise Dirichlet model (Q1611806) (← links)
- Computing sets of graded attribute implications with witnessed non-redundancy (Q1615669) (← links)
- A calculus for containment of fuzzy attributes (Q1626212) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
- Closure structures parameterized by systems of isotone Galois connections (Q1679638) (← links)
- On sets of graded attribute implications with witnessed non-redundancy (Q1750536) (← links)
- Pseudo-models and propositional Horn inference (Q1766742) (← links)
- Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors (Q1766746) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Direct-optimal basis computation by means of the fusion of simplification rules (Q1800392) (← links)
- Using congruence relations to extract knowledge from concept lattices (Q1800395) (← links)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey (Q1874537) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Closure systems, implicational systems, overhanging relations and the case of hierarchical classification (Q1887547) (← links)
- A compact representation for modular semilattices and its applications (Q2006979) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Quasi-closed elements in fuzzy posets (Q2059596) (← links)
- Steps towards causal Formal Concept Analysis (Q2076995) (← links)
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis (Q2076999) (← links)
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis (Q2117120) (← links)
