Lectures related to Satisfiability

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

Covers the interpretation of propositional logic and inference rules for implication, conjunction, and double negation.

Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.

Covers first-order logic syntax, semantics, and resolution for proving properties.

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

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.

Explores quantifiers with finite domains, uniqueness quantifier, composite statements, variable binding, and validity in logic.

Covers the concept of universe of discourse and truth values in predicate logic.

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

Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.

Explores encoding finite systems with boolean functions, propositional logic, inductive invariants, and formal proof systems.

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

Covers predicate logic basics, quantifiers, equivalences, and natural language translation examples.

Covers Presburger arithmetic, quantifier elimination, and the transformation of formulas into disjunctive normal form.

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

Explores factored representations for planning, focusing on reducing complexity and improving efficiency through separate feature modeling.

Covers Promise Constraint Satisfaction Problems complexity, width, graph coloring, polymorphisms, and algorithms.