NiVER
From MaRDI portal
Software:19021
swMATH6958MaRDI QIDQ19021FDOQ19021
Author name not available (Why is that?)
Cited In (19)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets
- Theory and Applications of Satisfiability Testing
- SATenstein: automatically building local search SAT solvers from components
- Eliminating Redundant Clauses in SAT Instances
- Theory and Applications of Satisfiability Testing
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- SAT modulo graphs: acyclicity
- An expressive model for instance decomposition based parallel SAT solvers
- Incremental preprocessing methods for use in BMC
- Theory and Applications of Satisfiability Testing
- Clause elimination procedures for CNF formulas
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- Simulating circuit-level simplifications on CNF
- On QBF Proofs and Preprocessing
- Title not available (Why is that?)
- 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
