On implicational bases of closure systems with unique critical sets.
From MaRDI portal
Publication:741717
DOI10.1016/j.dam.2013.08.033zbMath1341.06003arXiv1205.2881MaRDI QIDQ741717
J. B. Nation, K. V. Adaricheva
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2881
lattices of closed sets; canonical bases; closure systems; acyclic Horn formulas; CNF-representations; DNF-representations; Duquenne-Guigues bases; lattices without \(D\)-cycles; minimum bases; optimum bases; stem bases; unit bases
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
Notes on join semidistributive lattices, Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements, The joy of implications, aka pure Horn formulas: mainly a survey, RQL: a query language for rule discovery in databases, Algorithms for \(k\)-meet-semidistributive lattices, Using congruence relations to extract knowledge from concept lattices, Translating between the representations of a ranked convex geometry, Optimum basis of finite convex geometry, A representation of antimatroids by Horn rules and its application to educational systems, Directed hypergraphs and Horn minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exclusive and essential sets of implicates of Boolean functions
- The multiple facets of the canonical direct unit implicational basis
- A theory of finite closure spaces based on implications
- 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
- Optimum basis of finite convex geometry
- Finite Sublattices of a Free Lattice
- Minimal Representation of Directed Hypergraphs
- A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- Minimum Covers in Relational Database Model
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- Optimal implicational bases for finite modular lattices
- Reducibility among Combinatorial Problems