| On the Effect of Learned Clauses on Stochastic Local Search
|
2020 |
Lorenz, Jan-Hendrik |
| Distributed Cube and Conquer with Paracooba
|
2020 |
Heisinger, Maximilian |
| On the Sparsity of XORs in Approximate Model Counting
|
2020 |
Agrawal, Durgesh |
| Reasoning About Strong Inconsistency in ASP
|
2020 |
Mencia, Carlos |
| Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
|
2020 |
Beyersdorff, Olaf |
| Short Q-Resolution Proofs with Homomorphisms
|
2020 |
Shukla, Ankit |
| Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
|
2020 |
Ceska, Milan |
| Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
|
2020 |
Karpinski, Michal |
| 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 |
Tag hinzufügen