On the structure of some classes of minimal unsatisfiable formulas (Q1408380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zhao, Xishun / rank
Normal rank
 
Property / author
 
Property / author: Zhao, Xishun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Revision as of 11:11, 6 June 2024

scientific article
Language Label Description Also known as
English
On the structure of some classes of minimal unsatisfiable formulas
scientific article

    Statements

    On the structure of some classes of minimal unsatisfiable formulas (English)
    0 references
    0 references
    0 references
    15 September 2003
    0 references
    0 references
    Propositional formulas
    0 references
    Minimal unsatisfiability
    0 references
    Maximal formulas
    0 references
    Marginal formulas
    0 references
    Splitting of formulas
    0 references