Understanding Resolution in Theorem Proving

Exploring the process of resolution in theorem proving, starting from propositional resolution to the complexities of First-Order Logic. The conversion of FOL sentences to CNF, elimination of implications, variable standardization, Skolemization, and dropping universal quantifiers are all dissected

0 views • 34 slides