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
关键词
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 条
  • [31] NORMAL FORMS AND THE COMPLEXITY OF COMPUTATIONS OF LOGIC PROGRAMS
    OCHOZKA, V
    STEPANKOVA, O
    STEPANEK, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 385 : 357 - 371
  • [32] STUDY OF A PARALLEL INFERENCE MACHINE FOR PARALLEL EXECUTION OF LOGIC PROGRAMS
    YAOQING, G
    CHENGZHENG, S
    SHOUREN, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 457 : 143 - 153
  • [33] Automatic Complexity Analysis of Explicitly Parallel Programs
    Hoefler, Torsten
    Kwasniewski, Grzegorz
    PROCEEDINGS OF THE 26TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'14), 2014, : 226 - 235
  • [34] PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS.
    Ullman, Jeffrey D.
    Van Gelder, Allen
    Algorithmica (New York), 1988, 3 (01): : 5 - 42
  • [35] Using the parallel complexity of programs to improve compaction
    Pouzet, M
    PROCEEDINGS OF THE 1996 CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT '96), 1996, : 111 - 115
  • [36] PATH FOR AND-PARALLEL EXECUTION OF LOGIC PROGRAMS
    LEE, SH
    KIM, DH
    CHOE, KM
    INFORMATION PROCESSING LETTERS, 1994, 52 (04) : 191 - 199
  • [37] THE PARALLEL INTERPRETATION OF LOGIC PROGRAMS IN DISTRIBUTED ARCHITECTURES
    CORSINI, P
    FROSINI, G
    SPERANZA, G
    COMPUTER JOURNAL, 1989, 32 (01): : 29 - 35
  • [38] SEQUENTIALIZATION OF PARALLEL LOGIC PROGRAMS WITH MODE ANALYSIS
    MASSEY, BC
    TICK, E
    LOGIC PROGRAMMING AND AUTOMATED REASONING, 1993, 698 : 205 - 216
  • [39] Capturing parallel circumscription with disjunctive logic programs
    Janhunen, T
    Oikarinen, E
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 134 - 146
  • [40] Parallel execution of logic programs by load sharing
    Lin, Z
    JOURNAL OF LOGIC PROGRAMMING, 1997, 30 (01): : 25 - 51