| QBFFam: A Tool for Generating QBF Families from Proof Complexity
|
2021 |
Beyersdorff, Olaf |
| Lower Bounds for QCDCL via Formula Gauge
|
2021 |
Böhm, Benjamin |
| Davis and Putnam Meet Henkin: Solving DQBF with Resolution
|
2021 |
Blinkhorn, Joshua |
| Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
|
2021 |
Colnet, Alexis de |
| MCP: Capturing Big Data by Satisfiability (Tool Description)
|
2021 |
Hermann, Miki |
| Investigating the Existence of Costas Latin Squares via Satisfiability Testing
|
2021 |
Jin, Jiwei |
| Projection Heuristics for Binary Branchings Between Sum and Product
|
2021 |
Kullmann, Oliver |
| Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints
|
2021 |
Lester, Martin Mariusz |
| Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving
|
2021 |
Prevot, Nicolas |
| A Proof Builder for Max-SAT
|
2021 |
Py, Matthieu |
| DQBDD: An Efficient BDD-Based DQBF Solver
|
2021 |
Sić, Juraj |
| Deep Cooperation of CDCL and Local Search for SAT
|
2021 |
Cai, Shaowei |
| Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily
|
2021 |
Friedrich, Tobias |
| Chinese Remainder Encoding for Hamiltonian Cycles
|
2021 |
Heule, Marin J. H. |
| On the Hierarchical Community Structure of Practical Boolean Formulas
|
2021 |
Li, Chunxiao |
| XOR Local Search for Boolean Brent Equations
|
2021 |
Nawrocki, Wojciech |
| A Fast Algorithm for SAT in Terms of Formula Length
|
2021 |
Peng, Jungiang |
| OptiLog: A Framework for SAT-based Systems
|
2021 |
Ansótegui, Carlos |
| Hash-Based Preprocessing and Inprocessing Techniaues in SAT Solvers
|
2021 |
Cao, Henrik |
| Weighted Model Counting Without Parameter Variables
|
2021 |
Dilkas, Paulius |
Tag hinzufügen