COMPLEXITY OF THE PROBLEM OF BEING EQUIVALENT TO HORN FORMULAS

被引：2
|
作者：
Kogabaev, N. T. [1 ]
机构：
[1] Sobolev Inst Math, Novosibirsk, Russia
来源：
ALGEBRA AND LOGIC | 2022年 / 60卷 / 06期
关键词：
Horn formula; m-reducibility; Sigma(0)(1) set; REDUCTION METHOD;
D O I：
10.1007/s10469-022-09665-z
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We look at the complexity of the existence problem for a Horn sentence (identity, quasi-identity, for all-sentence, there exists-sentence) equivalent to a given one. It is proved that if the signature contains at least one symbol of arity k >= 2, then each of the problems mentioned is an m-complete Sigma(0 )(1)set.
引用
收藏
页码：380 / 388
页数：9
相关论文
共 50 条
  • [41] On complexity reduction of Σ1 formulas
    Zofia Adamowicz
    Pawe Zbierski
    Archive for Mathematical Logic, 2003, 42 : 45 - 58
  • [42] The complexity of variable minimal formulas
    CHEN ZhenYu1
    2 Software Institute
    3 Department of Mathematics
    Science Bulletin, 2010, (18) : 1957 - 1960
  • [43] REALIZATION COMPLEXITY OF PROPOSITIONAL FORMULAS
    KHOMICH, VI
    DOKLADY AKADEMII NAUK SSSR, 1970, 195 (05): : 1050 - &
  • [44] The complexity of variable minimal formulas
    CHEN ZhenYuXU BaoWen DING DeCheng National Key Laboratory for Novel Software TechnologyNanjing UniversityNanjing China Software InstituteNanjing UniversityNanjing China Department of MathematicsNanjing UniversityNanjing China
    Chinese Science Bulletin, 2010, 55 (18) : 1957 - 1960
  • [45] A branching heuristics for quantified renamable horn formulas
    Coste-Marquis, S
    Le Berre, D
    Letombe, F
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 393 - 399
  • [46] On Boolean models for Quantified Boolean Horn formulas
    Büning, HK
    Subramani, K
    Zhao, XS
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 93 - 104
  • [47] ON THE COMPLEXITY OF FORMULAS IN SEMANTIC PROGRAMMING
    Ospichev, Sergey
    Ponomarev, Denis
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2018, 15 : 987 - 995
  • [48] UNDERSTANDING AND USING CARBON EQUIVALENT FORMULAS
    NEWELL, WF
    WELDING JOURNAL, 1995, 74 (09) : 57 - 58
  • [49] Understanding and using carbon equivalent formulas
    Newell, W.F. Jr.
    Welding Journal (Miami, Fla), 1995, 74 (09):
  • [50] DEPTH OF PROOFS, DEPTH OF CUT FORMULAS AND COMPLEXITY OF CUT FORMULAS
    ZHANG, WH
    THEORETICAL COMPUTER SCIENCE, 1994, 129 (01) : 193 - 206
12345