(数理逻辑与软件工程)MLChapter01PropositionalLogic.ppt

Put the above sets of clauses together, we get the original set of clauses Φ={1. ～ P ∨ Q∨R， 2. ～ S ∨ ～ R，3. P, 4. S , 5. ～ Q} ～ P ∨ R from 1, 5 ～ R from 2, 4 ～ P from 6, 7 9. □ from 3, 8 ～ P ∨ Q∨R ～ P ∨ R ～ R S ～ S ∨ ～ R ～ Q ～ P P □ Resolution refutation tree S1.4 The soundness and completeness Resolution Lemma Let F be a CNF formula, represented as set of clauses. Let R be a resolvent of two clauses C1 and C2 in F. Then, F and F U {R} are equivalent. Resolution Theorem (of propositional logic) A clause set F is unsatisfiable if and only if □can be obtained by adding resolvents. 数理逻辑练习1 姓名 学号 1.什么是可满足的命题逻辑公式？什么是恒真的命 题逻辑公式？分别举例说明.2.什么是命题逻辑的解释？举例说明. 3.设P,Q,R,S是任意命题公式， 判断下列公式的类型. (1) (R ?(P ?R)) ?(﹁(Q ?P) ∧P).  (2) （P?R） ? ((Q ?S) ?((P ∨ Q）?R))). 4. 证明{ Q? (P?R)， (U ∧﹁V) ∨P, Q } ┠ (U ? V)?R Textbook, Exercise1.5, problem 15, (a), (b), (c). Textbook, Exercise1.6, problem 3, 数理逻辑练习2 姓名 学号 1. 利用归结方法证明 (p ∨ (q ∨ r)) ∧ (p ∨ ? q ) ∧ (q ∨ ? r) ∧ (r ∨ ? p ) ∧ (? p ∨ (? q ∨ ?r)) . 是不可满足的. 画出归结反驳树.2. 利用归结方法证明{ Q? (P?R)， (U ∧﹁V) ∨P, Q } ┠ (U ? V)?R 画出归结反驳树. 3. 利用归结方法证明 (p ∨ (q ∨ r)) ∧ (p ∨ ? q ) ∧ (q ∨ ? r) ∧ (r ∨ ? p ) ∧ (? p ∨ (? q ∨ ? r)) 是不可满足的. Thank You The end of Chapter 1 Example (? p ∧ q)→(p ∧ (r → q)) = ?(? p ∧ q) ∨ (p ∧ (? r ∨ q)) = ( p ∨ ? q) ∨ (p ∧ (? r ∨ q)) = ( p ∨ ? q ∨ p) ∧ (( p ∨ ? q ∨ ? r ∨ q)) = ( p ∨ ? q ) This formula is not valid, it is satisfiable. 1.5.3 Horn clauses and satisfiability Definition (Horn formula) A Horn formula is formula Φ of propositional logic if it can be generated as an instance of H in this grammar: P:= | T | p A:= P| P ∧ A C:= A→P H:= C | C∧ H We call each instance of C a Horn clause. ┴ Example: (p ∧ q ∧ s → p ) ∧ (p ∧