%0 Journal Article
%T Weak Conjunctive Normal Form for G3 Logic<br>G3逻辑中的弱合取范式
%A ZHANG Heng
%A ZHANG Ming-Yi
%A YANG Ben-Juan
%A <br>章衡
%A 张明义
%A 杨本娟
%J 计算机科学
%D 2007
%I 
%X 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 is based on charactering counter models in model-based-formulas, and the other is based on rewriting formulas according to transformation rules. In the end, we show that there is no polynomial time algorithm to reduce an arbitrary formula to the weak conjunctive normal form.
%K Weak conjunctive normal form
%K G3 logic
%K Normal form reduction
%K Computational complexity<br>弱合取范式
%K G3逻辑
%K 范式化简
%K 计算复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=F67B573005EECCC164441B91F2E48F25&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=E158A972A605785F&sid=4C100B7696CE9E24&eid=F1177A9DF1349B63&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=9