A Personal History of Practical SAT Solving

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


Duration: 58:06
1,141 views
26

Armin Biere (Johannes Kepler University)
https://simons.berkeley.edu/talks/tbd-308
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing



Other Videos By Simons Institute for the Theory of Computing


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
2021-05-12Panel Discussion on Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-12Quantum Algorithms for Optimization | Quantum Colloquium
2021-05-11The Multilinear Polytope for Acyclic Hypergraphs
2021-05-10Panel Discussion on Challenges and Opportunities in Synthesis
2021-05-07Formal Languages and Automata for Reward Function Specification and Efficient Reinforcement Learning
2021-05-07Avenir: Managing Data Plane Diversity via Control Plane Synthesis


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Armin Biere
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing