The complexity of variable minimal formulas

被引：1
|
作者：
Chen ZhenYu [1 ,2 ]
Xu BaoWen [1 ]
Ding DeCheng [3 ]
机构：
[1] Nanjing Univ, Natl Key Lab Novel Software Technol, Nanjing 210093, Peoples R China
[2] Nanjing Univ, Software Inst, Nanjing 210093, Peoples R China
[3] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
来源：
CHINESE SCIENCE BULLETIN | 2010年 / 55卷 / 18期
基金：
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词：
minimal unsatisfiability; prime implication; variable minimal equivalence; variable minimal satisfiability; FACETS;
D O I：
10.1007/s11434-010-3127-2
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Based on the common properties of logic formulas: equivalence and satisfiability, the concept of variable minimal formulas with property preservation is introduced. A formula is variable minimal if the resulting sub-formulas with any variable omission will change the given property. Some theoretical results of two classes: variable minimal equivalence (VME) and variable minimal satisfiability (VMS) are studied. We prove that VME is NP-complete, and VMS is in D-P and coNP-hard.
引用
收藏
页码：1957 / 1960
页数：4
相关论文
共 50 条
12345