Olaf Beyersdorff
6 papers · 2018–2026 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Interdisciplinary Bridge π Conference Polyglot (2) π Academic Marathon (7) π§ Keyword Pioneer π Cross-Pollinator (15)
π
Keyword Champion
(5)
β
The Questioner
Conferences
AAAI (4)
IJCAI (2)
Top co-authors
Keywords
proof complexity
(5)
quantified boolean formula
(4)
proof system
(3)
sat solver
(2)
resolution proof
(2)
model counting
(2)
decision diagram
(1)
resolution proof system
(1)
proof logging
(1)
cube learning
(1)
algorithm runtime
(1)
dependency scheme
(1)
pure literal elimination
(1)
combinatorial optimization
(1)
resolution system
(1)
computational complexity
(1)
knowledge compilation
(1)
tensor network
(1)
conflict-driven clause learning
(1)
sat solving
(1)
Papers
Proof Systems for Tensor-based Model Counting
AAAI 2026
Proof Systems That Tightly Characterise Model Counting Algorithms
AAAI 2026
Computationally Hard Problems Are Hard for QBF Proof Systems Too
AAAI 2025
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs
AAAI 2024
QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
IJCAI 2022
Dynamic Dependency Awareness for QBF
IJCAI 2018