The joy of implications, aka pure Horn formulas: mainly a survey
From MaRDI portal
(Redirected from Publication:507516)
Abstract: Apart from a brief look at applications (Relational Databases, Formal Concept Analysis, data mining) this article is devoted to the mathematical t h e o r y of implications (=pure Horn formulas). It is mainly a survey of results obtained in the last thirty years, but features a few novelties as well. Some keywords: The Duquenne-Guiges (implicational) base, the canonical direct base, prime implicates, the consensus method, implications and meet irreducible closed sets, optimum bases for certain lattices, ordered direct bases, generating all closed sets, general (i.e. impure) Horn functions. We pose four open problems to stimulate further research.
Recommendations
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 4001521 (Why is no real title available?)
- scientific article; zbMATH DE number 758787 (Why is no real title available?)
- scientific article; zbMATH DE number 861622 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- A characterization theorem for the canonical basis of a closure operator
- A logical approach for direct-optimal basis of implications
- A subclass of Horn CNFs optimally compressible in polynomial time
- A theory of finite closure spaces based on implications
- Algorithms for \(k\)-meet-semidistributive lattices
- An approach to lattice varieties of finite height
- Canonical Horn representations and query learning
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- Compactly generating all satisfying truth assignments of a Horn formula
- Comparing performance of algorithms for generating concept lattices
- Compressed representation of learning spaces
- Computational aspects of monotone dualization: a brief survey
- Computing premises of a minimal cover of functional dependencies is intractable
- Computing the minimum cover of functional dependencies
- Consensus algorithms for the generation of all maximal bicliques
- Design by example: An application of Armstrong relations
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
- Efficient algorithms for dualizing large-scale hypergraphs
- Fast algorithms for implication bases and attribute exploration using proper premises
- Finding all closed sets: A general approach
- Functional Dependencies in a Relational Database and Propositional Logic
- Fuzzy and rough formal concept analysis: a survey
- Greedoids
- Hardness results for approximate pure Horn CNF formulae minimization
- Horn approximations of empirical data
- Lattice Theory: Foundation
- Lattices of regular closed subsets of closure spaces
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Learning spaces. Interdisciplinary applied mathematics
- Minimal Representation of Directed Hypergraphs
- Minimum implicational basis for \(\wedge\)-semidistributive lattices
- Model Theory
- On Cores and Prime Implicants of Truth Functions
- On implicational bases of closure systems with unique critical sets.
- On the complexity of enumerating pseudo-intents
- Optimal implicational bases for finite modular lattices
- Optimum basis of finite convex geometry
- Ordered direct implicational basis of a finite closure system
- Realization of abstract convex geometries by point configurations
- Reasoning with models
- Redundancy, deduction schemes, and minimum-size bases for association rules
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Subgroup lattices and symmetric functions
- Succinctness and tractability of closure operator representations
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- The core of finite lattices
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- The multiple facets of the canonical direct unit implicational basis
- The prime stems of rooted circuits of closure spaces and minimum implicational bases
Cited in
(23)- Compressed representation of learning spaces
- Description of closure operators in convex geometries of segments on the line
- Decision systems in rough set theory: a set operatorial perspective
- A compact representation for modular semilattices and its applications
- Chemically inspired Erdős-Rényi hypergraphs
- On functional dependencies in q-Horn theories
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Lattice point of view for argumentation framework
- Foreword
- Translating between the representations of a ranked convex geometry
- Enumerating maximal consistent closed sets in closure systems
- On Dualization over Distributive Lattices
- Direct-optimal basis computation by means of the fusion of simplification rules
- Quasi-closed elements in fuzzy posets
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Algorithms for computing the Shapley value of cooperative games on lattices
- Scalable Visual Analytics in FCA
- Algorithms for \(k\)-meet-semidistributive lattices
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- A representation of antimatroids by Horn rules and its application to educational systems
- Convex geometries representable by at most five circles on the plane
- Representation of convex geometries by circles on the plane
This page was built for publication: The joy of implications, aka pure Horn formulas: mainly a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507516)
