A subclass of Horn CNFs optimally compressible in polynomial time (Q693287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/amai/BorosCKK09, #quickstatements; #temporary_batch_1731530891435
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59560576 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-010-9197-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999427653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn minimization by iterative decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exclusive and essential sets of implicates of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure identification in relational data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of a Data Base and the Theory of Boolean Switching Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn functions and their DNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional dependencies in Horn theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On functional dependencies in \(q\)-Horn theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification as a complexity measure for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covers in Relational Database Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Simplifying Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge compilation and theory approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/amai/BorosCKK09 / rank
 
Normal rank

Latest revision as of 21:54, 13 November 2024

scientific article
Language Label Description Also known as
English
A subclass of Horn CNFs optimally compressible in polynomial time
scientific article

    Statements

    A subclass of Horn CNFs optimally compressible in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    propositional Horn expert systems
    0 references
    Horn functions
    0 references
    Horn minimization
    0 references
    Boolean minimization
    0 references
    CQ functions
    0 references
    essential sets
    0 references
    exclusive sets
    0 references
    polynomial-time HM algorithm
    0 references

    Identifiers