Double Horn functions (Q1271644): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1998.2713 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965189594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-free and best-fit extensions of partially defined Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491589 / 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: Structure identification in relational data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Boolean \(\mu\)-expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn functions and submodular Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preferential Arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695825 / 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: Horn functions and their DNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sentences which are true of direct unions of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Very Simple Boolean Formulas with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial characterization of read-once formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn approximations of empirical data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Horn formulas matter in computer science: initial structures and generic examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions computed by monotone Boolean formulas with no repeated variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3268317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 17:25, 28 May 2024

scientific article
Language Label Description Also known as
English
Double Horn functions
scientific article

    Statements

    Double Horn functions (English)
    0 references
    0 references
    0 references
    0 references
    16 May 1999
    0 references
    disjunctive normal forms
    0 references
    double Horn functions
    0 references
    computational properties
    0 references
    partially defined Boolean functions
    0 references
    polynomnial-time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references