Resolution Principle
To understand the Resolution principle, first we need to know certain definitions.
- Literal – A variable or negation of a variable. Eg- [Tex]p, \neg q [/Tex]
- Sum – Disjunction of literals. Eg- [Tex]p\vee \neg q [/Tex]
- Product – Conjunction of literals. Eg- [Tex]p \wedge \neg q [/Tex]
- Clause – A disjunction of literals i.e. it is a sum.
- Resolvent – For any two clauses [Tex]C_{1} [/Tex]and [Tex]C_{2} [/Tex], if there is a literal [Tex]L_{1} [/Tex]in [Tex]C_{1} [/Tex]that is complementary to a literal [Tex]L_{2} [/Tex]in [Tex]C_{2} [/Tex], then removing both and joining the remaining clauses through a disjunction produces another clause [Tex]C [/Tex]. [Tex]C [/Tex]is called the resolvent of [Tex]C_{1} [/Tex]and [Tex]C_{2} [/Tex]
Rules of Inference
Rules of Inference: Every Theorem in Mathematics, or any subject for that matter, is supported by underlying proofs. These proofs are nothing but a set of arguments that are conclusive evidence of the validity of the theory. The arguments are chained together using Rules of Inferences to deduce new statements and ultimately prove that the theorem is valid.
Table of Content
- Definitions
- Table of Rule of inference
- Rules of Inference
- Resolution Principle:
- Rule of inference example,