Boolean satisfiability problem

Related lectures (31)

Page 2 of 4

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

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

Explores quantifier elimination steps for Presburger Arithmetic, emphasizing techniques to simplify and eliminate quantifiers efficiently.

Covers the case analysis rule, propositional resolution, soundness, completeness, and resolution on clauses, with practical exercises included.

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

Covers first-order logic syntax, semantics, Skolemization, resolution, and normal form transformations.

Explores predicate logic, focusing on quantifiers and normal forms, emphasizing the importance of finding witnesses and counterexamples.

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

Covers the calculation of propositions in predicate logic with a focus on logical connectives.