Small Unsatisfiable k-CNFs with Bounded Literal Occurrence.
|
SAT |
2024 |
0 |
QCDCL with cube learning or pure literal elimination - What is best?
|
Artificial Intelligence |
2024 |
0 |
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.
|
SAT |
2023 |
0 |
Co-Certificate Learning with SAT Modulo Symmetries.
|
IJCAI |
2023 |
0 |
Should Decisions in QCDCL Follow Prefix Order?
|
SAT |
2022 |
1 |
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
|
IJCAI |
2022 |
1 |
Davis and Putnam Meet Henkin: Solving DQBF with Resolution.
|
SAT |
2021 |
2 |
Finding the Hardest Formulas for Resolution (Extended Abstract).
|
IJCAI |
2021 |
1 |
Finding the Hardest Formulas for Resolution.
|
JAIR |
2021 |
0 |
Finding the Hardest Formulas for Resolution.
|
CP |
2020 |
4 |
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths.
|
SAT |
2020 |
2 |
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
|
KR |
2020 |
5 |
Combining Resolution-Path Dependencies with Dependency Learning.
|
SAT |
2019 |
4 |
Proof Complexity of Fragments of Long-Distance Q-Resolution.
|
SAT |
2019 |
4 |
Dependency Learning for QBF.
|
JAIR |
2019 |
0 |
Portfolio-Based Algorithm Selection for Circuit QBFs.
|
CP |
2018 |
15 |
Polynomial-Time Validation of QCDCL Certificates.
|
SAT |
2018 |
2 |
Dependency Learning for QBF.
|
SAT |
2017 |
47 |
Long Distance Q-Resolution with Dependency Schemes.
|
SAT |
2016 |
0 |