Efficient, verified checking of propositional proofs (Q1687744): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nathan D. Wetzler / rank
Normal rank
 
Property / author
 
Property / author: Nathan D. Wetzler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-66107-0_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2746765002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient certified RAT verification / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient execution in an automated reasoning environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Refutations with Extended Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inprocessing Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough Diamond: An Extension of Equivalence-Based Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization and implementation of modern SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive functions of symbolic expressions and their computation by machine, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: versat: A Verified Modern SAT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mechanical Verification of a DPLL-Based Satisfiability Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Verification of SAT Refutations with Extended Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank

Latest revision as of 22:20, 14 July 2024

scientific article
Language Label Description Also known as
English
Efficient, verified checking of propositional proofs
scientific article

    Statements

    Efficient, verified checking of propositional proofs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers