Logic课件.ppt

Inference rules Logical inference is used to create new sentences that logically follow from a given set of predicate calculus sentences (KB). An inference rule is sound if every sentence X produced by an inference rule operating on a KB logically follows from the KB. (That is, the inference rule does not create any contradictions) An inference rule is complete if it is able to produce every expression that logically follows from (is entailed by) the KB. (Note the analogy to complete search algorithms.) Sound rules of inference Here are some examples of sound rules of inference. Each can be shown to be sound using a truth table: A rule is sound if its conclusion is true whenever the premise is true. RULE PREMISE CONCLUSION Modus Ponens A, A => B B And Introduction A, B A ^ B And Elimination A ^ B A Double Negation ~~A A Unit Resolution A v B, ~B A Resolution A v B, ~B v C A v C Soundness of modus ponens A B A → B OK? True True True ? True False False ? False True True ? False False True ? Soundness of the resolution inference rule Proving Things Consider a KB consisting of the following rules and facts (collectively called premises) (Ho ^ Hu) => R “If it is hot and humid, then it is raining” Hu => Ho “If it is humid, then it is hot” Hu “It is humid.” We want to prove that it is raining Proving things A proof is a sequence of sentences, where each sentence is either a premise or a sentence derived from earlier sentences in the proof by one of the rules of inference. The last sentence is the theorem (also called goal or query) that we want to prove. Example for the “weather problem” given above. 1 Hu Premise “It is humid” 2 Hu=>Ho Premise “If it is humid, it is hot” 3 Ho Modus Ponens(1,2) “It is hot” 4 (Ho^Hu)=>R Premise “If it’s hot & humid, it’s raining” 5 Ho^Hu And Introduction(1,2) “It is hot and humid” 6 R Modus Ponens(4,5) “It is raining” Entailment and derivation Entailment: KB |= Q Q is entailed by KB (a set of premi