Using local search to find MSSes and MUSes (Q1042194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of propositional knowledge base revision, updates, and counterfactuals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact selection of minimally unsatisfiable subformulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / 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: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimal unsatisfiable subformulae by means of adaptive core search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 06:47, 2 July 2024

scientific article
Language Label Description Also known as
English
Using local search to find MSSes and MUSes
scientific article

    Statements

    Using local search to find MSSes and MUSes (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    0 references
    SAT
    0 references
    msses
    0 references
    muses
    0 references
    satisfiability
    0 references
    hybrid algorithm
    0 references
    0 references