Non-Automatability: When Finding Proofs Is Provably Hard

Non-Automatability: When Finding Proofs Is Provably Hard

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


Duration: 49:23
420 views
18

Susanna de Rezende (Czech Academy of Sciences)
https://simons.berkeley.edu/talks/proof-complexity-toolbox
Theoretical Foundations of SAT/SMT Solving



Other Videos By Simons Institute for the Theory of Computing


2021-05-26Decoding Nonhuman Communication | Polylogues
2021-05-21Conflict-Driven First-Order Decision Procedures
2021-05-21Solving String Constraints, Starting From the Beginning and From the End
2021-05-20Look-ahead SAT Solvers: Smart vs. Fast
2021-05-20Pseudo-Boolean Solving: In Between SAT and ILP
2021-05-20Searching Inside the Box: A Continuous-Local-Search Approach for Hybrid SAT Solving
2021-05-20Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
2021-05-20Using Resolution and Cutting Planes for Verification of Nonlinear Bit-Vector Properties
2021-05-20The Proof Complexity of Integer Programming
2021-05-20Hard Examples for Common Variable Decision Heuristics
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


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Theoretical Foundations of SAT/SMT Solving
Susanna de Rezende