Propositional and Predicate Calculus - Carleton University

69/77
Outline and Introduction
Propositional Calculus
Predicate Calculus
Inference Rules
Unification
Resolution Theorem Proving
Resolution Theorem
Clause Form
Resolution Theorem
Examples
It is a technique for proving theorems in propositional and predicate
calculus
It describes a way of finding contradictions in the databases with a
minimum use of substitutions
Method:
1 It proves a theorem by negating the statement to be proved
2 It adds this negated goal to the set of axioms that are
known to be true
3 It uses the inference rules to show that this leads to a
contradiction
4 If the negated goal is inconsistent with the given set of
axioms, it follows that the original goal is consistent