The joy of implications, aka pure Horn formulas: mainly a survey
From MaRDI portal
Publication:507516
DOI10.1016/j.tcs.2016.03.018zbMath1418.03144arXiv1411.6432OpenAlexW1866396423MaRDI QIDQ507516
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6432
minimizationlattice theoryassociation ruleformal concept analysisuniversal algebrafunctional dependenciesclosure systemconvex geometryBoolean logicmeet-irreduciblesprime implicatespure Horn functions
Related Items (19)
Scalable Visual Analytics in FCA ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Compressed representation of learning spaces ⋮ On Dualization over Distributive Lattices ⋮ Lattice point of view for argumentation framework ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Representation of convex geometries by circles on the plane ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Algorithms for \(k\)-meet-semidistributive lattices ⋮ A compact representation for modular semilattices and its applications ⋮ Translating between the representations of a ranked convex geometry ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Direct-optimal basis computation by means of the fusion of simplification rules ⋮ Dualization in lattices given by implicational bases ⋮ Quasi-closed elements in fuzzy posets ⋮ Description of closure operators in convex geometries of segments on the line ⋮ Enumerating maximal consistent closed sets in closure systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- Succinctness and tractability of closure operator representations
- Algorithms for \(k\)-meet-semidistributive lattices
- Design by example: An application of Armstrong relations
- On the complexity of enumerating pseudo-intents
- A subclass of Horn CNFs optimally compressible in polynomial time
- Consensus algorithms for the generation of all maximal bicliques
- On implicational bases of closure systems with unique critical sets.
- Greedoids
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Computational aspects of monotone dualization: a brief survey
- The multiple facets of the canonical direct unit implicational basis
- Realization of abstract convex geometries by point configurations
- Computing the minimum cover of functional dependencies
- The core of finite lattices
- Finding all closed sets: A general approach
- A theory of finite closure spaces based on implications
- A characterization theorem for the canonical basis of a closure operator
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Compressed representation of learning spaces
- Horn approximations of empirical data
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Ordered direct implicational basis of a finite closure system
- Computing premises of a minimal cover of functional dependencies is intractable
- The prime stems of rooted circuits of closure spaces and minimum implicational bases
- Fast algorithms for implication bases and attribute exploration using proper premises
- Hardness results for approximate pure Horn CNF formulae minimization
- Optimum basis of finite convex geometry
- Efficient algorithms for dualizing large-scale hypergraphs
- An approach to lattice varieties of finite height
- Reasoning with models
- Compactly generating all satisfying truth assignments of a Horn formula
- Lattices of regular closed subsets of closure spaces
- Learning Spaces
- Lattice Theory: Foundation
- Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
- Canonical Horn Representations and Query Learning
- Minimal Representation of Directed Hypergraphs
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- Functional Dependencies in a Relational Database and Propositional Logic
- Subgroup lattices and symmetric functions
- Comparing performance of algorithms for generating concept lattices
- Optimal implicational bases for finite modular lattices
- Model Theory
- Fuzzy and rough formal concept analysis: a survey
- On Cores and Prime Implicants of Truth Functions
This page was built for publication: The joy of implications, aka pure Horn formulas: mainly a survey
