Pseudo-Boolean Solving: In Between SAT and ILP

Pseudo-Boolean Solving: In Between SAT and ILP

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


Duration: 43:01
516 views
12

Jakob Nordstrom (University of Copenhagen & Lund University)
https://simons.berkeley.edu/talks/non-cdcl-solvers
Theoretical Foundations of SAT/SMT Solving



Other Videos By Simons Institute for the Theory of Computing


2021-07-15Quantum Garbled Circuits
2021-07-15Strongly Universal Hamiltonian Simulators
2021-07-15On the NLTS Conjecture
2021-07-15Device-Independent Protocols From Computational Assumptions
2021-07-15Classical Verification of Quantum Computational Advantage
2021-06-17Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication
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


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