Computer Science ›› 2013, Vol. 40 ›› Issue (5): 48-50.
Previous Articles Next Articles
ZHAI Cui-hong and QIN Ke-yun
[1] 张健.逻辑公式的可满足性判定-方法、工具及应用[M].北京:科学出版社,2000 [2] 秦永彬,张秋菊.基于关键文字的求解SAT问题的启发式算法[J].计算机与数字工程,2010,8:1-4 [3] Liberatore P.Redundancy in logic I:CNF propositional formulae [J].Artificial Intelligence,2005,163(30):203-232 [4] Liberatore P.Redundancy in logicⅡ:2CNF and Horn propositional formulae [J].Artificial Intelligence,2008,172(35):265-299 [5] Gottlob G,Ferm?ller C G.Removing redundancy from a clause [J].Artificial Intelligence,1993,61(27):263-289 [6] 徐扬,邹开其.布尔逻辑公式中文字和小项的可消性[J].西南交通大学学报,1990,1:107-112 [7] Ostrowski R,Mazure B,Sas L,et al.Eliminating redundancies in SAT search trees [C]∥Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTA’2003).Sacramento,2003,5:100-104 [8] 王国俊.数理逻辑引论与归结原理[M].北京:科学出版社,2006 |
No related articles found! |
|