Emre Yolcu

Email:	eyolcu [at] cs [dot] cmu [dot] edu
Office:	GHC 9215

I am a PhD student in the Computer Science Department at Carnegie Mellon University, advised by Marijn Heule. I am interested mostly in logic, in particular proof complexity, satisfiability, and related topics.

Research publications

Regular resolution effectively simulates resolution [pdf]
Sam Buss, Emre Yolcu
Manuscript
Lower bounds for set-blocked clauses proofs [pdf]
Emre Yolcu
Manuscript
Exponential separations using guarded extension variables [pdf]
Emre Yolcu, Marijn Heule
ITCS 2023
An automated approach to the Collatz conjecture [pdf]
Emre Yolcu, Scott Aaronson, Marijn Heule
Journal of Automated Reasoning 67(2), 2023
CADE 2021
Mycielski graphs and PR proofs [pdf]
Emre Yolcu, Xinyu Wu, Marijn Heule
SAT 2020 (Best Student Paper Award)
Learning local search heuristics for Boolean satisfiability [pdf]
Emre Yolcu, Barnabás Póczos
NeurIPS 2019

Talks

Regular resolution effectively simulates resolution [pdf]
Workshop on Proof Theory and Its Applications, University of BarcelonaJuly 2023
Encoding Collatz-like problems into termination of string rewriting [pdf]
Workshop on SAT Encodings and Beyond, Dagstuhl, WadernJune 2023
Weak versions of extended resolution [pdf]
Workshop on Proof Complexity and Meta-Mathematics, Simons Institute, BerkeleyMarch 2023
Exponential separations using guarded extension variables [pdf]
ITCS 2023, MIT, CambridgeJanuary 2023
Theory Lunch, CMU, PittsburghNovember 2022
MIAO Seminar, University of CopenhagenOctober 2022
Workshop on Theory and Practice of SAT and Combinatorial Solving, Dagstuhl, WadernOctober 2022
Workshop on Proof Complexity, Technion, HaifaAugust 2022
An automated approach to the Collatz conjecture [pdf]
CADE 2021July 2021
Workshop on Termination 2021July 2021
Workshop on Theoretical Foundations of SAT/SMT Solving, Simons Institute, BerkeleyApril 2021
Mycielski graphs and PR proofs [pdf]
SAT 2020July 2020