Satisfiability modulo theories

Applied sciences
Information engineering
Artificial intelligence
Automated planning and sche...

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (13)

Introduces Satisfiability Modulo Theories (SMT) solving, covering propositional logic, uninterpreted functions, and quantifier instantiation.

Refinement Types: Practicality and Soundness

Explores the practicality and soundness of refinement types, focusing on safe indexing and properties verification.

Propositional Resolution and SAT Solvers

Covers the transformation of formulas into conjunctive normal form and the efficiency of algorithms for checking satisfiability.

Induction for SMT Solvers

Explores techniques for induction in SMT solvers, focusing on CVC4's implementation and competitive performance with other provers.

Untitled

Boolean Satisfiability Problem: Solving Techniques

Explores the Boolean Satisfiability Problem and the Davis-Putnam-Logemann-Loveland algorithm, along with modern SAT solvers and efficient solving techniques.

Satisfiability and clusters

Covers satisfiability threshold, clusters of solutions, parameter alpha, and average cluster computation.

Untitled

Quantum Adiabatic Optimization: Combinatorial Problems

Explores Quantum Approximate Optimization Algorithm for solving combinatorial problems efficiently.

Constraint Satisfaction: Formulation and Algorithms

Covers the formulation of constraint satisfaction problems and systematic algorithms for solving them efficiently.

Convex Optimization: Yalmip Introduction

Introduces Yalmip, a MATLAB toolbox for optimization modeling and solving with MOSEK and GUROBI.

Propositional Resolution

Explores completeness in propositional logic, resolution on clauses, conjunctive form, unit resolution, SAT solvers, and proof generation.

Formal Proofs: Checking Invariants and Bounded Model Checking

Explores formal proofs, satisfiability problems, and inductive invariants using SAT queries in sequential circuits.

Page 1 of 1