Formalization and implementation of modern SAT solvers (Q839035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / 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 axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804883 / rank
 
Normal rank

Revision as of 22:08, 1 July 2024

scientific article
Language Label Description Also known as
English
Formalization and implementation of modern SAT solvers
scientific article

    Statements

    Formalization and implementation of modern SAT solvers (English)
    0 references
    0 references
    1 September 2009
    0 references
    SAT solving
    0 references
    DPLL
    0 references
    software verification
    0 references
    algorithms
    0 references
    data structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers