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 条
  • [31] COMPLEXITY RESULTS FOR CLASSES OF QUANTIFICATIONAL FORMULAS
    LEWIS, HR
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (03) : 317 - 353
  • [32] Complexity of automata, computing formulas values
    Vestnik Moskovskogo Universiteta, Seriya 1 (Matematika Mekhanika), (04): : 22 - 23
  • [33] ALGORITHMS OF MINIMAL COMPLEXITY
    MARANDZHYAN, GB
    DOKLADY AKADEMII NAUK SSSR, 1973, 213 (04): : 787 - 788
  • [34] Games on trees and syntactical complexity of formulas
    Krynicki, Michal
    Torres, Jose Maria Turull
    LOGIC JOURNAL OF THE IGPL, 2007, 15 (5-6) : 653 - 687
  • [35] The Complexity of Symmetry-Breaking Formulas
    Eugene M. Luks
    Amitabha Roy
    Annals of Mathematics and Artificial Intelligence, 2004, 41 : 19 - 45
  • [36] The complexity of symmetry-breaking formulas
    Luks, EM
    Roy, A
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2004, 41 (01) : 19 - 45
  • [37] On Recurrence Formulas for Computing the Stochastic Complexity
    Mononen, Tommi
    Myllymaki, Petri
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 280 - 285
  • [38] THE COMPLEXITY OF THE SATISFIABILITY PROBLEM FOR KROM FORMULAS
    DENENBERG, L
    LEWIS, HR
    THEORETICAL COMPUTER SCIENCE, 1984, 30 (03) : 319 - 341
  • [39] Minimal false quantified Boolean formulas
    Buening, Hans Kleine
    Zhao, Xishun
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 339 - 352
  • [40] ON CANONICAL FORMULAS FOR THE EXTENSIONS OF MINIMAL LOGIC
    Stukacheva, M. V.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2006, 3 : 312 - 334
12345