| 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 |
| 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 |
| SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing
|
2020 |
Ehlers, Rüdiger |
Tag hinzufügen