Playlist: 13 videos

Beyond Satisfiability

1:59:40

The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT

Kuldeep Meel (National University of Singapore)
https://simons.berkeley.edu/talks/tbd-257
Beyond Satisfiability
Visit talk page
2:23:6

Combining SAT and Computer Algebra for Circuit Verification

Daniela Kaufmann (Johannes Kepler University Linz)
https://simons.berkeley.edu/talks/tbd-262
Beyond Satisfiability
Visit talk page
2:39:41

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)
https://simons.berkeley.edu/talks/deep-dive-cdcl-pseudo-boolean-solvers-focusing-implementation-sat4j
Beyond Satisfiability
Visit talk page
2:1:38

Beyond NP with Tractable Circuits

Adnan Darwiche (UCLA)
https://simons.berkeley.edu/talks/beyond-np-tractable-circuits
Beyond Satisfiability
Visit talk page
2:22:31

What Maximum Clique Algorithms Can Teach Us, And Vice-Versa

Ciaran Mccreesh (University of Glasgow)
https://simons.berkeley.edu/talks/what-maximum-clique-algorithms-can-teach-us-and-vice-versa
Beyond Satisfiability
Visit talk page
2:18:1

Knowledge Compilation for Boolean Functional Synthesis

Supratik Chakraborty (IIT Bombay)
https://simons.berkeley.edu/talks/tbd-287
Beyond Satisfiability
Visit talk page
2:21:35

Exact Mixed-Integer Programming over the Rational Numbers

Ambros Gleixner (Zuse Institute Berlin and HTW Berlin)
https://simons.berkeley.edu/talks/exact-mip-solving
Beyond Satisfiability
Visit talk page
1:30:10

Answer Set Programming in a Nutshell

Torsten Schaub (University of Potsdam)
https://simons.berkeley.edu/talks/answer-set-programming
Beyond Satisfiability
Visit talk page
2:24:0

Maximum Satisfiability Solving

Jeremias Berg (University of Helsinki), Matti Järvisalo (University of Helsinki), and Ruben Martins (CMU)
https://simons.berkeley.edu/talks/maxsat
Beyond Satisfiability
Visit talk page
2:1:16

Step-Wise Explanations for Constraint Programs

Bart Bogaerts (Vrije Universiteit Brussel)
https://simons.berkeley.edu/talks/explainable-constraint-programming-kind
Beyond Satisfiability
Visit talk page