| 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 |
| Efficient AIl-UIP Learned Clause Minimization
|
2021 |
Fleury, Mathias |
| SAT-Based Rigorous Explanations for Decision Lists
|
2021 |
Ignatiev, Alexey |
| DiMo — Discrete Modelling Using Propositional Logic
|
2021 |
Hundeshagen, Norbert |
| The MErGESaAT Solver
|
2021 |
Manthey, Norbert |
| Scalable SAT Solving in the Cloud
|
2021 |
Schreiber, Dominik |
| Certified DQBF Solving by Definition Extraction
|
2021 |
Reichl, Franz-Xaver |
| 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 |
Tag hinzufügen