Cited in
(28)- QMaxSATpb
- Theory and Applications of Satisfiability Testing
- Clause elimination procedures for CNF formulas
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- SAT modulo graphs: acyclicity
- On QBF Proofs and Preprocessing
- sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Theory and Applications of Satisfiability Testing
- Simulating circuit-level simplifications on CNF
- scientific article; zbMATH DE number 5510694 (Why is no real title available?)
- An expressive model for instance decomposition based parallel SAT solvers
- sQueezeBF
- SATenstein: automatically building local search SAT solvers from components
- Nenofex
- BoolVar/PB
- npSolver
- On quantifying literals in Boolean logic and its applications to explainable AI
- MaxPre
- Quantor
- BooleForce
- ZRes
- SAT-Inspired Eliminations for Superposition
- FK-B
- Eliminating Redundant Clauses in SAT Instances
- Theory and Applications of Satisfiability Testing
- Incremental preprocessing methods for use in BMC
This page was built for software: NiVER
