Succinctness and tractability of closure operator representations

DOI10.1016/J.TCS.2015.12.028zbMATH Open1418.06001OpenAlexW2219393927WikidataQ54824445 ScholiaQ54824445MaRDI QIDQ507522FDOQ507522

Authors: Sebastian Rudolph 

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

Recommendations

• On the succinctness of closure operator representations
• Some Notes on Managing Closure Operators
• Bases of closure systems
• scientific article; zbMATH DE number 2159643
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey

zbMATH Keywords

tractabilitysuccinctnessclosure operatorscomputational propertiesformal contextsimplications

Mathematics Subject Classification ID

Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Reducibility among combinatorial problems
• Title not available (Why is that?)
• The decision problem for some classes of sentences without quantifiers
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• 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
• Counting of Moore families for \(n=7\)
• Some Notes on Pseudo-closed Sets
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• A decomposition method for CNF minimality proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Lattices of closure operators
• Some Notes on Managing Closure Operators
• Title not available (Why is that?)
• Hardness of enumerating pseudo-intents in the lectic order
• Some Computational Problems Related to Pseudo-intents
• On the succinctness of closure operator representations
• On the intractability of computing the Duquenne-Guigues base
• Formal Concept Analysis
• Some decision and counting problems of the Duquenne-Guigues basis of implications

Cited In (7)

• AC simplifications and closure redundancies in the superposition calculus
• On the succinctness of closure operator representations
• Translating between the representations of a ranked convex geometry
• Algorithms for computing the Shapley value of cooperative games on lattices
• On minimum matrix representation of closure operations
• The joy of implications, aka pure Horn formulas: mainly a survey
• Enhancing the conversational process by using a logical closure operator in phenotypes implications

This page was built for publication: Succinctness and tractability of closure operator representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507522)