Satisfiability of mixed Horn formulas (Q997066): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Ltur / rank
 
Normal rank
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.1016/j.dam.2007.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968262650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in graphs with at most one cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / 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: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and maximum independent sets in graphs with at mostr cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 11:36, 26 June 2024

scientific article
Language Label Description Also known as
English
Satisfiability of mixed Horn formulas
scientific article

    Statements

    Satisfiability of mixed Horn formulas (English)
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    (hidden) Horn formula
    0 references
    \(q\)-Horn formula
    0 references
    quadratic formula
    0 references
    (weighted) satisfiability
    0 references
    minimal vertex cover
    0 references
    fixed-parameter tractability
    0 references

    Identifiers