Pages that link to "Item:Q1663234"
From MaRDI portal
The following pages link to A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234):
Displaying 11 items.
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Verifying the conversion into CNF in dafny (Q2148786) (← links)
- versat: A Verified Modern SAT Solver (Q2891429) (← links)
- (Q5094131) (← links)
- Verified Decision Procedures for Modal Logics. (Q5875443) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
- (Q6060676) (← links)
- \textsc{Carcara}: an efficient proof checker and elaborator for SMT proofs in the Alethe format (Q6535368) (← links)
- Automated deduction (Q6602250) (← links)
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL (Q6611963) (← links)
- On enumerating short projected models (Q6657245) (← links)
