Step-Wise Explanations for Constraint Programs

Step-Wise Explanations for Constraint Programs

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


Duration: 2:01:16
395 views
11

Bart Bogaerts (Vrije Universiteit Brussel)
https://simons.berkeley.edu/talks/explainable-constraint-programming-kind
Beyond Satisfiability



Other Videos By Simons Institute for the Theory of Computing


2021-04-26Synthesis for Correctness Is Not Enough: How to Specify, Verify, and Synthesize Robust Systems
2021-04-26Optimization-based Formal Synthesis of Control Strategies for Dynamical Systems
2021-04-23Safe Human-Interactive Control via Shielding
2021-04-22Strict NP: Expressive Power, Structure, and Complexity
2021-04-22Where The Really Hard Problems Really Are?
2021-04-21An Automated Approach to the Collatz Conjecture
2021-04-21Symbolic Computation Techniques in SMT Solving: Mathematical Beauty Meets Efficient Heuristics
2021-04-21Computer Algebra and SAT for Mathematical Search
2021-04-21Panel Discussion on Postquantum Cryptography | Quantum Colloquium
2021-04-21Postquantum Cryptography | Quantum Colloquium
2021-04-20Step-Wise Explanations for Constraint Programs
2021-04-19Richard M. Karp Distinguished Lecture — How Difficult is it to Certify that a Random SAT Formula is
2021-04-16Distributed Computing Meets Game Theory: Fault Tolerance and Implementation with Cheap Talk
2021-04-15Complexity and Diversity
2021-04-15SAT and Foundations of Mathematics
2021-04-14Panel Discussion on Quantum Simulation | Quantum Colloquium
2021-04-14Quantum Simulation | Quantum Colloquium
2021-04-14Maximum Satisfiability Solving
2021-04-12Synthesizing Randomized Systems with Algorithmic Improvisation
2021-04-12Automated Verification and Control Synthesis for CPS Models
2021-04-12Synthesis of Safe, Small and Optimal Strategies for Cyber-Physical Systems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond Satisfiability
Bart Bogaerts