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

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10817-009-9127-8 / 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.1007/s10817-009-9127-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021196646 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S10817-009-9127-8 / rank
 
Normal rank

Latest revision as of 04:45, 10 December 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