Optimal compression of propositional Horn knowledge bases: Complexity and approximation
From MaRDI portal
Publication:1313951
Recommendations
Cites work
- A Way to Simplify Truth Functions
- Horn functions and their DNFs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Learning conjunctions of Horn clauses
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Structure identification in relational data
Cited in
(38)- An efficient algorithm for Horn description
- Horn functions and their DNFs
- Double Horn functions
- Horn minimization by iterative decomposition
- Semantical and computational aspects of Horn approximations
- On functional dependencies in q-Horn theories
- Recognition of tractable DNFs representable by a constant number of intervals
- Pseudo-models and propositional Horn inference
- A simple heuristic for knowledge base compression
- Bidual Horn functions and extensions
- Translating between the representations of a ranked convex geometry
- Hardness results for approximate pure Horn CNF formulae minimization
- On the hydra number of disconnected graphs
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Redundancy in logic. III: Non-monotonic reasoning
- Boolean functions with long prime implicants
- Redundancy in logic. I: CNF propositional formulae
- Unique key Horn functions
- A decomposition method for CNF minimality proofs
- Boolean functions with a simple certificate for CNF complexity
- Algorithms for computing minimal equivalent subformulas
- Hydras: complexity on general graphs and a subclass of trees
- Hydras: directed hypergraphs and Horn formulas
- Properties of Switch-List Representations of Boolean Functions
- Bounds on the size of PC and URC formulas
- Approximating minimum representations of key Horn functions
- The algebraic structure of the densification and the sparsification tasks for CSPs
- Relations between threshold and \(k\)-interval Boolean functions
- Envy-free relaxations for goods, chores, and mixed items
- The ghosts of forgotten things: a study on size after forgetting
- Common equivalence and size of forgetting from Horn formulae
- On CNF formulas irredundant with respect to unit clause propagation
- A subclass of Horn CNFs optimally compressible in polynomial time
- The complexity of simplifying -automata through the alternating cycle decomposition
- Disjoint essential sets of implicates of a CQ Horn function
- Exclusive and essential sets of implicates of Boolean functions
- Information loss in knowledge compilation: a comparison of Boolean envelopes
This page was built for publication: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313951)
