DRAT-trim
From MaRDI portal
Software:25228
No author found.
Related Items (51)
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ A proof system for graph (non)-isomorphism verification ⋮ Solution validation and extraction for QBF preprocessing ⋮ Two disjoint 5-holes in point sets ⋮ Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ The reflective Milawa theorem prover is sound (down to the machine code that runs it) ⋮ CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver ⋮ Proof checking and logic programming ⋮ Expressing Symmetry Breaking in DRAT Proofs ⋮ On crossing-families in planar point sets ⋮ Compositional Propositional Proofs ⋮ Machine learning-based restart policy for CDCL SAT solvers ⋮ Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking ⋮ Verifying integer programming results ⋮ Efficient certified RAT verification ⋮ DRAT-based bit-vector proofs in CVC4 ⋮ Guiding high-performance SAT solvers with unsat-core predictions ⋮ CrystalBall: gazing in the black box of SAT solving ⋮ A little blocked literal goes a long way ⋮ Unnamed Item ⋮ Efficient, verified checking of propositional proofs ⋮ Inconsistency Proofs for ASP: The ASP - DRUPE Format ⋮ Unnamed Item ⋮ An Expressive Model for Instance Decomposition Based Parallel SAT Solvers ⋮ A semantic framework for proof evidence ⋮ QMaxSATpb: a certified MaxSAT solver ⋮ Simulating strong practical proof systems with extended resolution ⋮ Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components ⋮ Truth Assignments as Conditional Autarkies ⋮ Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points ⋮ Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning ⋮ Proof Checking and Logic Programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property ⋮ Investigating the existence of large sets of idempotent quasigroups via satisfiability testing ⋮ Extended resolution simulates \({\mathsf{DRAT}}\) ⋮ A computational status update for exact rational mixed integer programming ⋮ The resolution of Keller's conjecture ⋮ A computational status update for exact rational mixed integer programming ⋮ Efficient verified (UN)SAT certificate checking ⋮ Strong extension-free proof systems ⋮ Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer ⋮ SAT competition 2020 ⋮ DRAT Proofs for XOR Reasoning ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ The resolution of Keller's conjecture ⋮ Flexible proof production in an industrial-strength SMT solver ⋮ Preprocessing of propagation redundant clauses ⋮ ProCount: weighted projected model counting with graded project-join trees
This page was built for software: DRAT-trim
