Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
is an extremely powerful rule of inference for Propositional Logic
Using propositional resolution (without axiom schemata or other rules of inference), it is possible to build a theorem prover that is sound and complete for all of Propositional Logic
The search space using propositional resolution is much smaller than for standard propositional logic
Propositional resolution works only on expressions in
Before the rule can be applied, the premises and conclusions must be converted to this form
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License