| 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 |
| 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 |
| PyDGGA: Distributed GGA for Automatic Configuration
|
2021 |
Ansótegui, Carlos |
| Hardness and Optimality in QBF Proof Systems Modulo NP
|
2021 |
Chew, Leroy |
| ProCount: Weighted Projected Model Counting with Graded Project-Join Trees
|
2021 |
Dudek, Jeffrey M. |
| Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5
|
2021 |
Huang, Pei |
| Assessing Progress in SAT Solvers Through the Lens of Incremental SAT
|
2021 |
Kochemazov, Stepan |
Tag hinzufügen