A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: versat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Locales / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IsaFoL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AVATAR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Archive Formal Proofs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790974881 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q64950500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locales: a module system for mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Sledgehammer with SMT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Proof and Disproof in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing the Metatheory of Sledgehammer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-intelligible Isar proofs from machine-generated proofs / 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: Soundness and completeness proofs by coinductive methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast LCF-Style Proof Reconstruction for Z3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imperative Functional Programming with Isabelle/HOL / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: versat: A Verified Modern SAT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code Generation via Higher-Order Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247076 / 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: Partial Recursive Functions in Higher-Order Logic / 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: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Data Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement to Imperative/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of Abstract State Transition Systems for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete Semantics / 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: Formalization of the Resolution Calculus for First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematics, Machines and Gödel's Proof / 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: AVATAR: The Architecture for First-Order Theorem Provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning Building Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program development by stepwise refinement / rank
 
Normal rank

Latest revision as of 09:40, 16 July 2024

scientific article
Language Label Description Also known as
English
A verified SAT solver framework with learn, forget, restart, and incrementality
scientific article

    Statements

    A verified SAT solver framework with learn, forget, restart, and incrementality (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2018
    0 references
    SAT solvers
    0 references
    CDCL
    0 references
    DPLL
    0 references
    proof assistants
    0 references
    Isabelle/HOL
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers