Succinctness and tractability of closure operator representations
From MaRDI portal
Publication:507522
DOI10.1016/j.tcs.2015.12.028zbMath1418.06001OpenAlexW2219393927WikidataQ54824445 ScholiaQ54824445MaRDI QIDQ507522
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.028
Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (3)
The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Translating between the representations of a ranked convex geometry ⋮ Algorithms for computing the Shapley value of cooperative games on lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decomposition method for CNF minimality proofs
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- Lattices of closure operators
- The number of Moore families on \(n=6\)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- On the number of databases and closure operations
- Some Notes on Managing Closure Operators
- Counting of Moore Families for n=7
- Hardness of Enumerating Pseudo-intents in the Lectic Order
- Some Notes on Pseudo-closed Sets
- Some Computational Problems Related to Pseudo-intents
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimal Representation of Directed Hypergraphs
- Minimum Covers in Relational Database Model
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- On the Succinctness of Closure Operator Representations
- Reducibility among Combinatorial Problems
- The decision problem for some classes of sentences without quantifiers
- Formal Concept Analysis
This page was built for publication: Succinctness and tractability of closure operator representations
