Theory and Practice of Satisfiability Solving
Videos from CMO Workshop
Laurent Simon, LaBRI / University of Bordeaux
Monday Aug 27, 2018 08:59 - 10:02
Towards an (experimental) understanding of SAT Solvers
Massimo Lauria, Università degli studi di Roma - La Sapienza
Monday Aug 27, 2018 10:11 - 11:14
Introduction to Proof Complexity for SAT practitioner
Marijn Heule, University of Texas at Austin
Monday Aug 27, 2018 11:43 - 12:45
Computable Short Proofs
Jo Devriendt, KU Leuven
Monday Aug 27, 2018 16:44 - 17:42
Symmetry in SAT - a quest for pigeonhole
Stephan Gocht, KTH Royal Institute of Technology
Monday Aug 27, 2018 17:36 - 18:03
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Susanna de Rezende, Czech Academy of Sciences
Monday Aug 27, 2018 18:08 - 18:36
Clique Is Hard for State-of-the-Art Algorithms
Moshe Vardi, Rice University
Monday Aug 27, 2018 18:41 - 19:06
Boolean Satisfiability: Theory and Engineering
Jakob Nordström, University of Copenhagen
Tuesday Aug 28, 2018 09:04 - 10:09
Towards Faster Conflict-Driven Pseudo-Boolean Solving
Ambros Gleixner, Zuse Institute Berlin
Tuesday Aug 28, 2018 12:42 - 13:48
Computational Mixed-Integer Programming
Joao Marques-Silva, LASIGE, Faculty of Sciences, University of Lisbon
Tuesday Aug 28, 2018 16:35 - 17:04
Towards MaxSAT-Based Proof Systems
Nina Narodytska, VMware Research
Tuesday Aug 28, 2018 17:07 - 17:41
Formal Analysis of Deep Binarized Neural Networks
Daniel Le Berre, Université d'Artois
Tuesday Aug 28, 2018 17:44 - 18:13
Pseudo-Boolean Optimization
Marc Vinyals, Technion
Tuesday Aug 28, 2018 18:15 - 18:44
Proof Systems for Pseudo-Boolean Solving
Sam Buss, University of California, San Diego
Tuesday Aug 28, 2018 18:49 - 19:22
The (un)reasonable (in)effectiveness of theory for Sat solvers
Mikoláš Janota, IST/INESC-ID, U. of Lisbon
Wednesday Aug 29, 2018 09:04 - 10:05
Advances in QBF Solving
Susan Margulies, United States Naval Academy
Wednesday Aug 29, 2018 10:14 - 11:08
Hilbert's Nullstellensatz, Grobner Bases, and NP-Complete Problems
Olaf Beyersdorff, University of Jena
Wednesday Aug 29, 2018 10:16 - 11:15
QBF Proof Complexity
Manuel Kauers, Johannes Kepler University
Thursday Aug 30, 2018 09:04 - 10:10
Gröbner bases and applications
Rahul Santhanam, University of Oxford
Thursday Aug 30, 2018 11:31 - 12:30
A Survey on Worst-Case Complexity of SAT
Klas Markström, Umeå universitet
Thursday Aug 30, 2018 11:39 - 12:32
Random k-sat. A review and some new results.
Ruben Martins, Carnegie Mellon University
Thursday Aug 30, 2018 13:15 - 13:48
Conflict-Driven Synthesis
Martina Seidl, Johannes Kepler University
Thursday Aug 30, 2018 16:35 - 17:01
The Symmetry Rule for Quantified Boolean Formulas
Antonina Kolokolova, Memorial University of Newfoundland
Thursday Aug 30, 2018 17:04 - 17:36
The Proof Complexity of SMT Solvers
Nathan Mull, University of Chicago
Thursday Aug 30, 2018 17:40 - 18:09
On CDCL-based Proof Systems with the Ordered Decision Strategy
Maria Luisa Bonet, Universitat Politècnica de Catalunya
Thursday Aug 30, 2018 18:13 - 18:43
Algorithms beyond Resolution using MaxSAT
Laurent Simon, LaBRI / University of Bordeaux
Thursday Aug 30, 2018 18:46 - 19:13
A few results, questions, and pitfalls in the experimental study of SAT solvers
Vijay Ganesh, University of Waterloo
Friday Aug 31, 2018 09:37 - 10:14
Machine Learning for SAT Solvers
Aina Niemetz, Stanford University
Friday Aug 31, 2018 10:17 - 10:41
From Local Search to Quantifier Elimination for Bit-Vectors in SMT
Albert Atserias, Universitat Politecnica de Catalunya
Friday Aug 31, 2018 11:07 - 11:39
Circular (Yet Sound) Proofs
Alexander Knop, UC San Diego
Friday Aug 31, 2018 11:44 - 12:10
Hard Satisfiable Formulas for Splittings by Linear Combinations
