Marijn Heule
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Bryan Parnoonce
- Emre Yolcuonce
- Ruben Martinsonce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Trustworthy Automated Reasoning | Satisfiability: Theory, Practice, and Beyond 2023 | 2023-04-17 |
Claims validated with formally-verified proof checker: Boolean Pythagorean Triples is unsatisfiable for 1..7,824 with proofs that reach terabytes to petabytes… | ||
| Exponential separations using guarded extension variables | ITCS 2023 | 2023-01-10 |
Proves exponential separations between redundancy-based CNF proof systems by embedding short extended‑resolution (ER) proofs into guarded formulas so only some… | ||
| Finding Invariants of Distributed Systems: It's a Small (Enough) World After All | NSDI ’21 | 2021-04-12 |
Swiss automates construction of inductive invariants by exhaustively searching a bounded candidate space, using counterexample-guided synthesis and SMT checks… | ||
| Short Proofs in Strong Proof Systems | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
Claims that stronger, interference-based clausal proof systems let SAT solvers produce exponentially shorter certificates than resolution, using techniques… | ||
| nothing matches | ||