| Four Flavors of Entailment
|
2020 |
Möhle, Sibylle |
| Designing New Phase Selection Heuristics
|
2020 |
Shaw, Arijit |
| Simplified and Improved Separations Between Regular and General Resolution by Lifting
|
2020 |
Vinyals, Marc |
| Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems
|
2020 |
Larrosa, Javier |
| A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
|
2020 |
Colnet, Alexis de |
| Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases
|
2020 |
Seed, Thomas |
| Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
|
2020 |
Jonás, Martin |
| Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
|
2020 |
Schlaipfer, Matthias |
| Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles
|
2020 |
Anderson, Matthew |
| Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving
|
2020 |
Vallade, Vincent |
| Trail Saving on Backtrack
|
2020 |
Hickey, Randy |
| Sorting Parity Encodings by Reusing Variables
|
2020 |
Chew, Leroy |
| Improving Implementation of SAT Competitions 2017-2019 Winners
|
2020 |
Kochemazov, Stepan |
| Reproducible Efficient Parallel SAT Solving
|
2020 |
Nabeshima, Hidetomo |
| On CDCL-Based Proof Systems with the Ordered Decision Strategy
|
2020 |
Mull, Nathan |
| Mycielski Graphs and PR Proofs
|
2020 |
Yolcu, Emre |
| Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
|
2020 |
Li, Chunxiao |
| A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
|
2020 |
Slivovsky, Friedrich |
| Abstract Cores in Implicit Hitting Set MaxSat Solving
|
2020 |
Berg, Jeremias |
| MaxSAT Resolution and Subcube Sums
|
2020 |
Filmus, Yuval |
Tag hinzufügen