BerkMin: A fast and robust SAT-solver (Q2643301): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CMU Benchmarks / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATLIB Benchmark Suite / 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.2006.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143934828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint-based approach to narrow search trees for satisfiability / 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: SATO: An efficient propositional prover / rank
 
Normal rank

Latest revision as of 14:08, 26 June 2024

scientific article
Language Label Description Also known as
English
BerkMin: A fast and robust SAT-solver
scientific article

    Statements

    BerkMin: A fast and robust SAT-solver (English)
    0 references
    0 references
    0 references
    23 August 2007
    0 references
    0 references
    satisfiability testing
    0 references
    decision-making procedure
    0 references
    clause database management
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references