Workshops

Spring 2021

Satisfiability: Theory, Practice, and Beyond Reunion

Jun 14, 2022 to Jun 17, 2022

Return to event »

Click on the titles of individual talks for abstract, slides and archived video. All talks listed in Pacific Time.

Tuesday, June 14th, 2022
8:30 am–8:50 am		Coffee & Check In
8:50 am–9:00 am		Opening Remarks
9:00 am–10:00 am		Proofs, Circuits, and Total Search Problems Susanna de Rezende (Czech Academy of Sciences)
10:00 am–10:30 am		On Proof Complexity of Resolution Over Polynomial Calculus Erfan Khaniki (Charles University)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Separations in Proof Complexity and TFNP Robert Robere (McGill University)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Functional Synthesis: An Ideal Meeting Ground for Formal Methods and Machine Learning Kuldeep Singh Meel (National University of Singapore)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Towards Characterizing Efficient Boolean Functional Synthesis Supratik Chakraborty (IIT Bombay)
4:00 pm–4:30 pm		Program Synthesis as Dependency Quantified Formula Modulo Theory Priyanka Golia (National University of Singapore)
4:30 pm–5:30 pm		Reception

Wednesday, June 15th, 2022
8:30 am–9:00 am		Coffee & Check In
9:00 am–10:00 am		TBD Antonina Kolokolova (Memorial University of Newfoundland)
10:00 am–10:30 am		On Quantitative Testing of Samplers Mate Soos (National University of Singapore)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Proof Logging for Combinatorial Optimization Using Pseudo-Boolean Reasoning Jakob Nordström (University of Copenhagen & Lund University)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Certified Symmetry and Dominance Breaking for Combinatorial Optimisation Stephan Gocht (Lund University)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Bringing Proof Logging to Things That Aren't SAT Ciaran McCreesh (University of Glasgow)
4:00 pm–4:30 pm		Solving SAT Translating It To Max2XOR Jordi Levy (Artificial Intelligence Research Institute, Spanish National Research Council)

Thursday, June 16th, 2022
8:30 am–9:00 am		Coffee & Check In
9:00 am–10:00 am		Consistent Query Answering via SAT Solving Phokion Kolaitis (UC Santa Cruz and IBM Research)
10:00 am–10:30 am		Searching for Kochen–Specker Systems with Satisfiability Solving and Orderly Generation Curtis Bright (University of Windsor)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		MAJORITY kSAT is in P Ryan Williams (Massachusetts Institute of Technology)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		On CDCL vs. Resolution in QBF Olaf Beyersdorff (Friedrich-Schiller University of Jena)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		SAT-Powered Heuristics for Very Large Instances André Schidler (TU Wien)
4:00 pm–4:30 pm		MaxSat Resolution and SubCube Sums. Meena Mahajan (Institute of Mathematical Sciences)

Friday, June 17th, 2022
8:30 am–9:00 am		Coffee & Check In
9:00 am–10:00 am		CDCL Versus Resolution Marc Vinyals (Saint Petersburg State University)
10:00 am–10:30 am		A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion Dmitry Sokolov (Steklov Institute of Mathematics, Russia)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		What Are We Trying to Optimize by Restarting (A Real - And Fun - Experimental Set Up) Laurent Simon (Bordeaux INP)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Extremely Deep Proofs Noah Fleming (University of Toronto)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Towards Algebraic Methods in Descriptive Complexity Evgenia Ternovska (Simon Fraser University)