Pages that link to "Item:Q1313951"
From MaRDI portal
The following pages link to Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951):
Displaying 28 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- Relations between threshold and \(k\)-interval Boolean functions (Q646713) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- Double Horn functions (Q1271644) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Pseudo-models and propositional Horn inference (Q1766742) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On the hydra number of disconnected graphs (Q2322888) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
