人工智能的课件_1题目.pdfVIP

1. 把下列谓词公式分别化为相应的子句集： (1) (∀x)(∀y)(P(x,y)∧ Q(x,y)) (2) (∀x)(∀y)(P(x,y)→ Q(x,y)) (3) (∀x)(∃y)(P(x,y)∨ (Q(x,y)→ R(x,y))) (4) (∀x)(∀y)(∃z)(P(x,y)→ Q(x,y)∨ R(x,z)) (5) (∃x)(∃y)(∀z)(∃u)(∀v)(∃w)(P(x,y,zu, ,v,w)∧ (Q(x,y,zu, ,v,w)∨ ¬R(x,z,w))) 2. 对下列各题分别证明G 是否为F ,F ,⋯,F 的逻辑结论： 1 2 n F :(∀x)(P(x)→ (Q(x)∧ R(x))) 1 (1) F :(∃x)(P(x)∧ S(x)) 2 G:(∃x)(S(x)∧ R(x)) F :(∀x)(A(x)