Cited in
(only showing first 100 items - show all)- TBUDDY
- Transition_Systems_and_Automata
- A nonexistence certificate for projective planes of order ten with weight 15 codewords
- A little blocked literal goes a long way
- Strong extension-free proof systems
- CrystalBall: gazing in the black box of SAT solving
- Solution validation and extraction for QBF preprocessing
- Verifying integer programming results
- Efficient, verified checking of propositional proofs
- ChvatalIP
- Exact SCIP
- PReLearn
- Goeland
- FRAT
- PaPILO
- cake_lpr
- SLIME
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
- QMaxSATpb: a certified MaxSAT solver
- A semantic framework for proof evidence
- SaDiCaL
- CertiStr
- CrystalBall
- SAT competition 2020
- BoSy
- Local redundancy in SAT: generalizations of blocked clauses
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Flexible proof production in an industrial-strength SMT solver
- Two disjoint 5-holes in point sets
- CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Compositional propositional proofs
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- DRABT
- A proof system for graph (non)-isomorphism verification
- ProCount: weighted projected model counting with graded project-join trees
- Guiding high-performance SAT solvers with unsat-core predictions
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Expressing symmetry breaking in DRAT proofs
- Efficient verified (UN)SAT certificate checking
- Proof checking and logic programming
- Proof checking and logic programming
- An expressive model for instance decomposition based parallel SAT solvers
- Simulating strong practical proof systems with extended resolution
- scientific article; zbMATH DE number 7350778 (Why is no real title available?)
- Preprocessing of propagation redundant clauses
- DRAT-based bit-vector proofs in CVC4
- Investigating the existence of large sets of idempotent quasigroups via satisfiability testing
- Efficient certified RAT verification
- Machine learning-based restart policy for CDCL SAT solvers
- kcnfs
- SBSAT
- WALA
- QSopt_ex
- NiVER
- PicoSAT
- Plingeling
- SMTInterpol
- CLSAT
- versat
- Bloqqer
- DepQBF
- Equinox
- D-FLAT
- CryptoMiniSat
- tawSolver
- Skeptik
- Autoref
- Lynx
- MathCheck
- Treengeling
- libclang
- Coprocessor
- sharpSAT
- On crossing-families in planar point sets
- COMiniSatPS
- Jimple
- VIPR
- GPU-PRISM
- GPUexplore
- SageSAT
- Shatter
- LRAT
- GRAT
- GRATchk
- MaxPre
- Teyjus
- multi2boolean
- CAQE
- FlowDroid
- conauto
- Lingeling
- HQSpre
- BooleForce
- Imperative Refinement
- ZRes
- CaDiCaL
- IEEE_Floating_Point
- YalSAT
- SMTCoq
This page was built for software: DRAT-trim
