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 条

[41] AN AND-PARALLEL EXECUTION MODEL OF LOGIC PROGRAMS
SCHWINN, B
BARTH, G
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 213 : 289 - 300
[42] A study on parallel semantics of constrint logic programs
Sun, JG
Zhang, YG
PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 2182 - 2187
[43] Visualization of and/or-parallel execution of logic programs
Vaupel, R
Pontelli, E
Gupta, G
LOGIC PROGRAMMING: PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1997, : 271 - 285
[44] MULTIPLE PROPOSITIONAL DYNAMIC LOGIC OF PARALLEL PROGRAMS
DANECKI, R
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 240 - 248
[45] Architecture for visualizing the execution of parallel logic programs
Brayshaw, Mike
IJCAI, Proceedings of the International Joint Conference on Artificial Intelligence, 1600, 2
[46] Parallel execution of logic programs by load sharing
NEC Research Institute, Inc., 4 Independence Way, Princeton, NJ 08540, United States
J Logic Program, 1 (XI-51):
[47] Parallel interpretation of logic programs in distributed architectures
Corsini, P., 1600, (32):
[48] Parallel execution of logic programs by load sharing
NEC Research Inst, Inc, Princeton, United States
J Logic Program, 1 (25-51):
[49] REPORT ON THE INTERNATIONAL WORKSHOP ON THE COMPLEXITY OF SIMPLE PROGRAMS
Zenil, Hector
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2009, (97): : 175 - 177
[50] ON THE COMPLEXITY OF DATA-FLOW ANALYSIS OF LOGIC PROGRAMS
DEBRAY, SK
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1995, 17 (02): : 331 - 365

← 1 2 3 4 5 →