THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS

被引：11

作者：

AFRATI, F

PAPADIMITRIOU, CH

机构：

[1] STANFORD UNIV,STANFORD,CA 94305

[2] UNIV CALIF SAN DIEGO,DEPT COMP SCI,LA JOLLA,CA 92093

来源：

JOURNAL OF THE ACM | 1993年 / 40卷 / 04期

关键词：

ALA; LNA; THN; ALGORITHMS; LANGUAGES; THEORY; AUTOMATON; NC; P-COMPLETENESS; POLYNOMIAL FRINGE; POLYNOMIAL STOCK; PUSHDOWN;

D O I：

10.1145/153724.153752

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider logic programs with a single recursive rule, whose right-hand side consists of binary relations forming a chain. We give a complete characterization of all programs of this form that are computable in NC (assuming that P not-equal NC). Our proof uses ideas from automata and language theory, and the combinatories of strings.

引用

页码：891 / 916

页数：26

共 50 条

[1] THE PARALLEL COMPLEXITY OF SINGLE RULE LOGIC PROGRAMS
AFRATI, F
[J]. DISCRETE APPLIED MATHEMATICS, 1992, 40 (02) : 107 - 126
[2] SOME RESULTS ON THE COMPLEXITY OF EXPLOITING DATA DEPENDENCY IN PARALLEL LOGIC PROGRAMS
DELCHER, A
KASIF, S
[J]. JOURNAL OF LOGIC PROGRAMMING, 1989, 6 (03): : 229 - 241
[3] The complexity of revising logic programs
Greiner, R
[J]. JOURNAL OF LOGIC PROGRAMMING, 1999, 40 (2-3): : 273 - 298
[4] COMPLEXITY OF TRANSFORMED LOGIC PROGRAMS
STEPANKOVA, O
STEPANEK, P
[J]. JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 343 - 344
[5] Complexity of Simple Programs Preface
Woods, Damien
Neary, Turlough
Seda, Anthony K.
[J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 1 - 1
[6] Simple Random Logic Programs
Namasivayam, Gayathri
Trusczynski, Miroslaw
[J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2009, 5753 : 223 - 235
[7] Variable complexity of simple programs
Holzer, Markus
Kutrib, Martin
[J]. FUNDAMENTA INFORMATICAE, 2006, 74 (04) : 511 - 528
[8] On the semantics and complexity of probabilistic logic programs
[J]. 2017, AI Access Foundation (60):
[9] On the Semantics and Complexity of Probabilistic Logic Programs
Cozman, Fabio Gagliardi
Maua, Denis Deratani
[J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 60 : 221 - 262
[10] Monadic logic programs and functional complexity
Matos, AB
[J]. THEORETICAL COMPUTER SCIENCE, 1997, 176 (1-2) : 175 - 204

← 1 2 3 4 5 →