swMATH13313MaRDI QIDQ25228FDOQ25228
Author name not available (Why is that?)
Official website: http://www.cs.utexas.edu/~marijn/drat-trim/
Cited In (only showing first 100 items - show all)
- Local redundancy in SAT: generalizations of blocked clauses
- Arg2P
- QMaxSATpb
- TBUDDY
- Transition_Systems_and_Automata
- Flexible proof production in an industrial-strength SMT solver
- Compositional propositional proofs
- DRABT
- BoSy
- ProCount: weighted projected model counting with graded project-join trees
- Guiding high-performance SAT solvers with unsat-core predictions
- Efficient verified (UN)SAT certificate checking
- An expressive model for instance decomposition based parallel SAT solvers
- Title not available (Why is that?)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
- On crossing-families in planar point sets
- Title not available (Why is that?)
- The resolution of Keller's conjecture
- The resolution of Keller's conjecture
- DRAT proofs for XOR reasoning
- A computational status update for exact rational mixed integer programming
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
- Extended resolution simulates \({\mathsf{DRAT}}\)
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Truth assignments as conditional autarkies
- SaDiCaL
- Strong extension-free proof systems
- Solution validation and extraction for QBF preprocessing
- CrystalBall: gazing in the black box of SAT solving
- Verifying integer programming results
- CertiStr
- CrystalBall
- Local negative circuits and cyclic attractors in Boolean networks with at most five components
- QMaxSATpb: a certified MaxSAT solver
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- 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
- A proof system for graph (non)-isomorphism verification
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Kissat
- Paracooba
- Sylvan
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Expressing symmetry breaking in DRAT proofs
- Proof checking and logic programming
- Proof checking and logic programming
- Simulating strong practical proof systems with extended resolution
- 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
- Title not available (Why is that?)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- A computational status update for exact rational mixed integer programming
- 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
- The reflective Milawa theorem prover is sound (down to the machine code that runs it)
- COMiniSatPS
- Jimple
- VIPR
- GPU-PRISM
- GPUexplore
- SageSAT
- Shatter
- LRAT
- GRAT
- GRATchk
- MaxPre
- Teyjus
- multi2boolean
- CAQE
- FlowDroid
- conauto
- Lingeling
- HQSpre
- BooleForce
This page was built for software: DRAT-trim
