The following pages link to NiVER (Q19021):
Displaying 19 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- On QBF Proofs and Preprocessing (Q2870148) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- (Q3604003) (← links)
- Eliminating Redundant Clauses in SAT Instances (Q3612408) (← links)
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (Q4930581) (← links)
- Clause Elimination Procedures for CNF Formulas (Q4933317) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- Theory and Applications of Satisfiability Testing (Q5713710) (← links)
- Theory and Applications of Satisfiability Testing (Q5713747) (← links)
- Theory and Applications of Satisfiability Testing (Q5713748) (← links)
- A Gröbner Basis Approach to CNF-Formulae Preprocessing (Q5758133) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)