There are multiple rules of inference in formal systems of logic that are used to infer new propositions from given propositions. For instance, modus ponens is a rule of inference: (p ∧ (p ⊃ q)) ⊃ q (if p implies q, and p, therefore q), often written . Application of modus ponens supports the elimination of antecedents (e.g., p) from a logical proof and, therefore, is referred to as the rule of detachment. Resolution is the primary rule of inference used in logic programming. Resolution is designed to be used with propositions in CNF. It can be stated as follows:
This rule indicates ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
. Application of modus ponens supports the elimination of antecedents (e.g., p) from a logical proof and, therefore, is referred to as the rule of detachment. Resolution is the primary rule of inference used in logic programming. Resolution is designed to be used with propositions in CNF. It can be stated as follows: