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