Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: HeerHugo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Leibniz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4444470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / 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: Q5687266 / 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: Q5687274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Davis-Putnam method / rank
 
Normal rank

Latest revision as of 10:11, 6 June 2024

scientific article
Language Label Description Also known as
English
Approximating minimal unsatisfiable subformulae by means of adaptive core search
scientific article

    Statements

    Approximating minimal unsatisfiable subformulae by means of adaptive core search (English)
    0 references
    0 references
    15 September 2003
    0 references
    Consistency restoring
    0 references
    Enumeration
    0 references
    (Un)Satisfiability
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers