Algorithmic utilization of structure in SAT instances

Channel:

Subscribers:

68,700

Published on May 18, 2021 4:55:29 AM ● Video Link: https://www.youtube.com/watch?v=WhyS2ONbvsU

Duration: 55:29

401 views

Stefan Szeidar (TU Wien)
https://simons.berkeley.edu/talks/tbd-264
Theoretical Foundations of SAT/SMT Solving

Other Videos By Simons Institute for the Theory of Computing

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

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Theoretical Foundations of SAT/SMT Solving

Stefan Szeidar