Towards an (Experimental) Understanding of SAT Solvers

Towards an (Experimental) Understanding of SAT Solvers

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,800
Published on ● Video Link: https://www.youtube.com/watch?v=ZNghg_yz76Y


Duration: 41:29
1,047 views
29

Laurent Simon (Bordeaux INP)
https://simons.berkeley.edu/talks/tbd-263
Theoretical Foundations of SAT/SMT Solving



Other Videos By Simons Institute for the Theory of Computing


2021-05-19Non-Automatability: When Finding Proofs Is Provably Hard
2021-05-19Hard Formulas in Proof Complexity by Composition
2021-05-19Proof Complexity meets Finite Model Theory
2021-05-18Encodings and Consistency from a Constraint Programming Perspective
2021-05-18Advantages and limitations of Dual-Rail MaxSAT
2021-05-18Representing problems to SAT solvers: basic theory, basic questions
2021-05-17Structural Parameters - Heterogeneity and Geometry
2021-05-17Algorithmic utilization of structure in SAT instances
2021-05-17On the Formal Characterization of Industrial SAT Instances
2021-05-16On Using Structural Properties to Improve CDCL Solver Performance
2021-05-16Towards an (Experimental) Understanding of SAT Solvers
2021-05-16Perspectives on Practice and Theory of SAT Solving
2021-05-14Abstract Value Iteration for Hierarchical Reinforcement Learning
2021-05-14A Negotiation Procedure for Distributed Reactive Synthesis
2021-05-14Theoretically Speaking — A Panel Discussion on the Film Coded Bias
2021-05-13On Time, and Space, and Width, and Depth
2021-05-13A Personal History of Practical SAT Solving
2021-05-12Constrained Gradient Descent Algorithm for Testing Neural Networks
2021-05-12DL2: Training and Querying Neural Networks with Logic
2021-05-12Training Neural Networks with a Little Help from Knowledge
2021-05-12Unifying Logical and Statistical AI with Markov Logic


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing