Towards ML for Quantification in SMT

Towards ML for Quantification in SMT

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


Duration: 1:59:59
406 views
13

Mikoláš Janota (Czech Technical University)
https://simons.berkeley.edu/talks/tbd-310
Beyond Satisfiability



Other Videos By Simons Institute for the Theory of Computing


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
2021-05-06Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond
2021-05-06Using Program Synthesis to Build Compilers
2021-05-05Preprocessing SAT, MaxSAT, and QBF 3
2021-05-05Preprocessing SAT, MaxSAT, and QBF 2
2021-05-05Preprocessing SAT, MaxSAT, and QBF 1
2021-05-05Panel Discussion on The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-05The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-04Towards ML for Quantification in SMT
2021-05-03Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
2021-05-03Synthesizing Network Configuration Updates
2021-04-30Computational Aspects of Equilibria and Fixed Points
2021-04-30Data Privacy | Polylogues
2021-04-29Symmetric Properties and Boolean Complexity
2021-04-29Constraint Satisfaction and Expansion
2021-04-29Theoretically Speaking — Market Design through the Lens of Approximation
2021-04-28Learning to Solve SMT Formulas
2021-04-28Extensions of CDCL Branching Heuristics by Exploration during Conflict Depression
2021-04-28Learning to Schedule Heuristics in Branch and Bound


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Mikoláš Janota
Beyond Satisfiability