A Finite-Model-Theoretic View on Propositional Proof Complexity

Channel:

Subscribers:

68,700

Published on April 27, 2021 6:45:01 PM ● Video Link: https://www.youtube.com/watch?v=4PtLzJeDxgw

Duration: 38:03

311 views

Benedikt Pago (Rwth Aachen University)
https://simons.berkeley.edu/talks/finite-model-theory
Theoretical Foundations of SAT/SMT Solving

Other Videos By Simons Institute for the Theory of Computing

2021-04-28	Learning to Solve SMT Formulas
2021-04-28	Extensions of CDCL Branching Heuristics by Exploration during Conflict Depression
2021-04-28	Learning to Schedule Heuristics in Branch and Bound
2021-04-28	Predicting Satisfiability at the Phase Transition via End-to-End Learning
2021-04-28	Can the PvsNP Question Be Independent of the Axioms of Mathematical Reasoning?
2021-04-28	TAUT, TFNP and SAT
2021-04-28	P, NP and Proof Complexity
2021-04-28	Panel Discussion on Quantum Benchmarking \| Quantum Colloquium
2021-04-28	Classical Shadows of Quantum States \| Quantum Colloquium
2021-04-27	Quantified Boolean Formulas
2021-04-27	A Finite-Model-Theoretic View on Propositional Proof Complexity
2021-04-27	Reasoning Systems from Descriptive Complexity
2021-04-27	Past and Present of Descriptive Complexity Theory
2021-04-26	Provably Correct Training of Neural Network Controllers
2021-04-26	Coordination of for Large Collections of Dynamical Systems with Constraint Satisfaction Guarantees
2021-04-26	Synthesis for Correctness Is Not Enough: How to Specify, Verify, and Synthesize Robust Systems
2021-04-26	Optimization-based Formal Synthesis of Control Strategies for Dynamical Systems
2021-04-23	Safe Human-Interactive Control via Shielding
2021-04-22	Strict NP: Expressive Power, Structure, and Complexity
2021-04-22	Where The Really Hard Problems Really Are?
2021-04-21	An Automated Approach to the Collatz Conjecture

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Theoretical Foundations of SAT/SMT Solving

Benedikt Pago