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
- Clause Elimination Procedures for CNF Formulas
- Eliminating Redundant Clauses in SAT Instances
- Theory and Applications of Satisfiability Testing
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- Incremental preprocessing methods for use in BMC
- Theory and Applications of Satisfiability Testing
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
- SAT Modulo Graphs: Acyclicity
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
- 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
This page was built for software: NiVER
