形式化5:否定范式NNF

编程入门 行业动态 更新时间:2024-10-10 17:26:39

形式化5:否定<a href=https://www.elefans.com/category/jswz/34/1756719.html style=范式NNF"/>

形式化5:否定范式NNF

NNF规约

否定范式具有如下的规定:

  1. 否定仅出现在原子变量前
  2. 没有蕴含符 → \to →

如下:

P : : = P ∣ ¬ P ∣ ⊤ ∣ ⊥ ∣ P ∨ P ∣ P ∧ P \begin{aligned} P ::&= P \\ &|\ \neg P \\ &|\ \top \\ &|\ \bot \\ &|\ P\lor P \\ &|\ P\land P \end{aligned} P::​=P∣ ¬P∣ ⊤∣ ⊥∣ P∨P∣ P∧P​

转化为NNF

C ( P ) = P C ( ∼ P ) = ∼ P C ( ∼ ∼ P ) = C ( P ) C ( P ∧ Q ) = C ( P ) ∧ C ( Q ) C ( P ∨ Q ) = C ( P ) ∨ C ( Q ) C ( ∼ ( P ∧ Q ) ) = C ( ∼ P ) ∨ C ( ∼ Q ) C ( ∼ ( P ∨ Q ) ) = C ( ∼ P ) ∧ C ( ∼ Q ) C ( P → Q ) = ∼ C ( P ) ∨ C ( Q ) \begin{aligned} C(P) &= P \\ C(\sim P) &= \sim P \\ C(\sim \sim P) &= C(P) \\ C(P\land Q) &= C(P)\land C(Q) \\ C(P\lor Q) &= C(P)\lor C(Q) \\ C(\sim (P\land Q)) &= C(\sim P)\lor C(\sim Q) \\ C(\sim (P\lor Q)) &= C(\sim P)\land C(\sim Q) \\ C(P \to Q) &= \sim C(P)\lor C(Q) \\ \end{aligned} C(P)C(∼P)C(∼∼P)C(P∧Q)C(P∨Q)C(∼(P∧Q))C(∼(P∨Q))C(P→Q)​=P=∼P=C(P)=C(P)∧C(Q)=C(P)∨C(Q)=C(∼P)∨C(∼Q)=C(∼P)∧C(∼Q)=∼C(P)∨C(Q)​

  • 例题1

C ( p → ( q → p ) ) = ∼ C ( p ) ∨ ( q → p ) = ∼ p ∨ ( ∼ C ( q ) ∨ C ( p ) ) = ∼ p ∨ ( ∼ q ∨ p ) [ n n f − o k , b u t f u r t h e r ] = ∼ p ∨ p ∨ ∼ q = ⊤ \begin{aligned} C(p \to (q \to p)) &= \sim C(p) \lor (q \to p) \\ &= \sim p \lor (\sim C(q) \lor C(p)) \\ &= \sim p \lor (\sim q \lor p) \qquad [nnf-ok,\ but\ further] \\ &= \sim p \lor p \lor \sim q \\ &= \top \end{aligned} C(p→(q→p))​=∼C(p)∨(q→p)=∼p∨(∼C(q)∨C(p))=∼p∨(∼q∨p)[nnf−ok, but further]=∼p∨p∨∼q=⊤​

  • 例题2

C ( ∼ ( ( p 1 ∧ ∼ p 2 ) ∨ ( p 3 ∨ ∼ p 4 ) ) ) = C ( ∼ ( p 1 ∧ ∼ p 2 ) ) ∧ C ( ∼ ( p 3 ∨ ∼ p 4 ) ) = ( C ( ∼ p 1 ) ∨ C ( ∼ ( ∼ p 2 ) ) ) ∧ ( C ( ∼ p 3 ) ∧ C ( ∼ ( ∼ p 4 ) ) ) = ( ∼ p 1 ∨ p 2 ) ∧ ( ∼ p 3 ∧ p 4 ) \begin{aligned} C&(\sim ((p1 \land \sim p2) \lor (p3 \lor \sim p4))) \\ &= C(\sim (p1 \land \sim p2)) \land C(\sim (p3 \lor \sim p4)) \\ &= (C(\sim p1) \lor C(\sim (\sim p2))) \land (C(\sim p3) \land C(\sim (\sim p4))) \\ &= (\sim p1 \lor p2) \land (\sim p3 \land p4) \end{aligned} C​(∼((p1∧∼p2)∨(p3∨∼p4)))=C(∼(p1∧∼p2))∧C(∼(p3∨∼p4))=(C(∼p1)∨C(∼(∼p2)))∧(C(∼p3)∧C(∼(∼p4)))=(∼p1∨p2)∧(∼p3∧p4)​

更多推荐

形式化5:否定范式NNF

本文发布于:2024-03-05 11:07:58,感谢您对本站的认可!
本文链接:https://www.elefans.com/category/jswz/34/1712122.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
本文标签:范式   NNF

发布评论

评论列表 (有 0 条评论)
草根站长

>www.elefans.com

编程频道|电子爱好者 - 技术资讯及电子产品介绍!