计算机科学 ›› 2007, Vol. 34 ›› Issue (4): 158-162.
• 计算机网络与信息安全 • 上一篇 下一篇
出版日期:
发布日期:
基金资助:
Online:
Published:
摘要: 本文为G3逻辑提出一种类似于经典逻辑中合取范式的弱合取范式,并给出两种范式化简算法:一种是通过公式刻画反模型的语义方法;另一种为基于重写翻译的语法方法。文章最后证明,在G3逻辑中对任意公式做弱合取范式化简不存在多项式算法。
关键词: 弱合取范式 G3逻辑 范式化简 计算复杂性
Abstract: In this paper, we put forward a weak conjunctive normal form for G3 logic, which is similar to the conjunctive normal form for classical propositional logic. We also give two algorithms to reduce a formula to the weak, conjunctive normal form, where one i
Key words: Weak conjunctive normal form, G3 logic, Normal form reduction, Computational complexity
. G3逻辑中的弱合取范式[J]. 计算机科学, 2007, 34(4): 158-162. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2007/V34/I4/158
Cited