2015AI课件lec7知识表示和推理.pptVIP

Part Ⅲ Knowledge Representation and Reasoning知识表示和推理 付 岩 Fuyan@hrbeu.edu.cn 13 The Proposition Calculus 命题演算 13.1 Propositional Logic 命题逻辑 Propositional Logic Proposition 命题 The sentence which has the true or false meaning. Paradoxes are not proposition. Atomic proposition compound proposition 原子命题和复合命题 Atomic proposition: P Q R P1 P2 ON_A_B Compound proposition: atomic propositions + connective + punctuations Propositional Logic Connective 联结词 Disjunction 析取 ∨ （或、可兼或） Conjunction 合取 ∧ Propositional Logic Negation 否定 ┓ Implication 蕴含 (→) Propositional Logic Well-formed formulas 合式公式 (wff) （sentence 句子） Any atom is a wff. Eg: P、R、P3. If ω 1 is wff, then ┓ω 1 is wff. If ω 1, ω 2 are wff, then ω 1∧ω2 ω 1∨ω2 ω 1 ω2 are wff. Applying ①②③ finite times. 13 The Proposition Calculus 命题演算 13.3 Rule of Inference 推理规则 Commonly used rules of inference Modus pones(假言推理、演绎推理) if wff ω1 and ω1 ω2 then wff ω2. ∧ introduction if wff ω1 and ω2, then ω1∧ω2. commutativity of ∧(∨) if wff ω1∧ω2, then wff ω2∧ω1. (∨) (∨) Commonly used rules of inference ∧elimination if wff ω1∧ω2, then ω1, ω2. ∨introduction if wff ω1 or ω2, then ω1∨ω2. ┓elimination if wff ┓(┓ω1), then wff ω1. 13 The Proposition Calculus 命题演算 13.4 Definition of Proof 验证的定义 Definition of Proof P221 The sequence of wffs {ω1, ω2…., ωn} is called a proof (or a deduction of ωn) from a set of wffs Δ iff each ωi in the sequence is either in Δ or can be inferred from a wff (or wffs) earlier in the sequence by using one of the rules of inference. proof: Δ ┝ ω1, ω2…., ωn. Proof Δ ┝ ωn expressing that ωn can be proved from Δ . we say that ωn is a theorem of set Δ. Δ ┝R ωn expressing that ωn can be proved from Δ using the inference rules in R. R is the set of inference rules. Proof Eg: Δ :{P, R, P Q} Proof: Δ ┝ {P, P Q, Q, R, Q∧R} Proof The concept of proof can be based on a partial order.