Workshops

Spring 2021

Beyond Satisfiability

Feb. 9, 2021, Feb. 16, 2021, Feb. 23, 2021, Mar. 9, 2021, Mar. 16, 2021, Mar. 23, 2021, Mar. 30, 2021, Apr. 6, 2021, Apr. 13, 2021, Apr. 20, 2021, Apr. 27, 2021, May 4, 2021, May 11, 2021

Return to event »

Tuesday, February 9th, 2021
8:30 am – 10:30 am		The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT Kuldeep Meel (National University of Singapore)

Tuesday, February 16th, 2021
8:30 am – 10:30 am		Combining SAT and Computer Algebra for Circuit Verification Daniela Kaufmann (Johannes Kepler University Linz)

Tuesday, February 23rd, 2021
8:30 am – 10:30 am		Deep Dive into CDCL Pseudo-Boolean Solvers (focusing on the implementation in Sat4j) Romain Wallon (Laboratoire d'informatique de l'École polytechnique) & Daniel Le Berre (Université d'Artois)

Tuesday, March 9th, 2021
8:30 am – 10:30 am		Beyond NP with Tractable Circuits Adnan Darwiche (UCLA)

Tuesday, March 16th, 2021
8:30 am – 10:30 am		What Maximum Clique Algorithms Can Teach Us, And Vice-Versa Ciaran Mccreesh (University of Glasgow)

Tuesday, March 23rd, 2021
8:30 am – 10:30 am		TBD TBD

Tuesday, March 30th, 2021
8:30 am – 10:30 am		Exact MIP solving Ambros Gleixner (Zuse Institute Berlin)