Complexity of the Problem of Being Equivalent to Horn Formulas. II

被引：1

作者：

Kogabaev, N. T. ^{[1
]}

机构：

[1] Sobolev Inst Math, Novosibirsk, Russia

来源：

ALGEBRA AND LOGIC | 2023年 / 61卷 / 4期

关键词：

Horn formula; m-reducibility; S-1(0)-set; REDUCTION METHOD;

D O I：

10.1007/s10469-023-09700-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We look at the complexity of the existence problem for a Horn sentence equivalent to a given one. It is proved that for a signature consisting of one unary function symbol and any finite number of unary predicate symbols, the problem is computable. For a signature with at least two unary function symbols, it is stated that the problem mentioned is an m-complete Sigma 10set.

引用

页码：318 / 327

页数：10

共 28 条

[1] Complexity of the Problem of Being Equivalent to Horn Formulas. II
N. T. Kogabaev
Algebra and Logic, 2022, 61 : 318 - 327
[2] COMPLEXITY OF THE PROBLEM OF BEING EQUIVALENT TO HORN FORMULAS
Kogabaev, N. T.
ALGEBRA AND LOGIC, 2022, 60 (06) : 380 - 388
[3] Complexity of the Problem of Being Equivalent to Horn Formulas
N. T. Kogabaev
Algebra and Logic, 2022, 60 : 380 - 388
[4] ON THE COMPLEXITY OF THE MAXIMUM SATISFIABILITY PROBLEM FOR HORN FORMULAS
JAUMARD, B
SIMEONE, B
INFORMATION PROCESSING LETTERS, 1987, 26 (01) : 1 - 4
[5] Integrability Formulas. Part II
Li, Bo
Ma, Na
Liang, Xiquan
FORMALIZED MATHEMATICS, 2010, 18 (02): : 129 - 141
[6] ON GENERALIZED AVERAGED GAUSSIAN FORMULAS. II
Spalevic, Miodrag M.
MATHEMATICS OF COMPUTATION, 2017, 86 (306) : 1877 - 1885
[7] A dilation theory approach to cubature formulas. II
Putinar, M
MATHEMATISCHE NACHRICHTEN, 2000, 211 : 159 - 175
[8] Dependency quantified Horn formulas:: Models and complexity
Bubeck, Uwe
Buening, Hans Kleine
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 198 - 211
[9] Substitution in First-Order Formulas. Part II. The Construction of First-Order Formulas
Braselmann, Patrick
Koepke, Peter
FORMALIZED MATHEMATICS, 2005, 13 (01): : 27 - 32
[10] THE COMPLEXITY OF THE SATISFIABILITY PROBLEM FOR KROM FORMULAS
DENENBERG, L
LEWIS, HR
THEORETICAL COMPUTER SCIENCE, 1984, 30 (03) : 319 - 341

← 1 2 3 →