计算机科学 ›› 2013, Vol. 40 ›› Issue (5): 48-50.

• 2012多值逻辑专栏 • 上一篇    下一篇

命题逻辑公式中的冗余子句及冗余文字

翟翠红,秦克云   

  1. 西南交通大学数学学院 成都610031;西南交通大学数学学院 成都610031
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金项目(61175055)资助

Redundancy Clause and Redundancy Literal of Propositional Logic

ZHAI Cui-hong and QIN Ke-yun   

  • Online:2018-11-16 Published:2018-11-16

摘要: 主要研究命题逻辑公式中的冗余子句和冗余文字。针对子句集中必需的、有用的、无用的子句,分别给出了一些等价描述方法,进而讨论子句集的无冗余等价子集。另外,得到了子句集中冗余文字的判别方法,借助可满足性给出了冗余子句的一种等价条件。上述结果为命题逻辑公式的化简奠定了一些理论基础。

关键词: 冗余子句,冗余文字,无冗余等价子集,可满足性

Abstract: We mainly studied the redundancy of clause and literal in the propositional logic formula.Some equivalent descriptions of necessary,useful and useless clause for a particular set of clauses were given respectively,and the irredundant equivalent subsets of any set of clauses were discussed.In addition,an approach of identification of redundant literal was presented.At last,an equivalent condition of the redundancy clause was obtained by using the concept of satisfiability.These results serve as the theoretical foundation of a new method for simplifying the propositional logic formula.

Key words: Redundancy clause,Redundancy literal,Irredundant equivalent subset,Satisfiability

[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,Sas 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!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!