Satisfiability

Related lectures (19)

Page 1 of 2

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.