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 条
  • [31] On Formulas for Equivalent Potential Temperature
    Davies-Jones, Robert
    MONTHLY WEATHER REVIEW, 2009, 137 (09) : 3137 - 3148
  • [32] The method of synthesis of derivability conditions for horn formulas and some other formulas
    Vassilyev, S
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 1451 - 1456
  • [33] A PROBLEM ON FORMULAS
    BROWNE, EJ
    JOURNAL OF CHEMICAL EDUCATION, 1985, 62 (03) : 242 - 242
  • [34] On the complexity of equational horn clauses
    Verma, KN
    Seidl, H
    Schwentick, T
    AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 337 - 352
  • [35] Learning orthogonal F-Horn formulas
    Takimoto, E
    Miyashiro, A
    Maruoka, A
    Sakai, Y
    THEORETICAL COMPUTER SCIENCE, 1997, 185 (01) : 177 - 190
  • [36] MODUS PONENS AND DERIVATION FROM HORN FORMULAS
    CRAIG, W
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1967, 13 (01): : 33 - &
  • [37] The complexity of variable minimal formulas
    Chen ZhenYu
    Xu BaoWen
    Ding DeCheng
    CHINESE SCIENCE BULLETIN, 2010, 55 (18): : 1957 - 1960
  • [38] Models and quantifier elimination for quantified Horn formulas
    Bubeck, Uwe
    Buening, Hans Kleine
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1606 - 1622
  • [39] ON GENERALIZED HORN FORMULAS AND K-RESOLUTION
    BUNING, HK
    THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 405 - 413
  • [40] On complexity reduction of Σ1 formulas
    Adamowicz, Z
    Zbierski, P
    ARCHIVE FOR MATHEMATICAL LOGIC, 2003, 42 (01) : 45 - 58
12345