NORMAL FORMS AND THE COMPLEXITY OF COMPUTATIONS OF LOGIC PROGRAMS

被引：0

|

作者：

OCHOZKA, V ^{[1
]}

STEPANKOVA, O ^{[1
]}

STEPANEK, P ^{[1
]}

机构：

[1] CHARLES UNIV, DEPT COMP SCI, MALOSTRANSKE NAMESTI 25, CS-11800 PRAGUE 1, CZECHOSLOVAKIA

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 385卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：357 / 371

页数：15

相关论文

共 50 条

[1] FUNCTIONAL COMPUTATIONS IN LOGIC PROGRAMS
DEBRAY, SK
WARREN, DS
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1989, 11 (03): : 451 - 481
[2] DATAFLOW PROGRAMS FOR PARALLEL COMPUTATIONS OF LOGIC PROGRAMS AND THEIR SEMANTICS
YAMASAKI, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 366 : 104 - 114
[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] TRANSFORMING NORMAL LOGIC PROGRAMS TO CONSTRAINT LOGIC PROGRAMS
KANCHANASUT, K
STUCKEY, PJ
[J]. THEORETICAL COMPUTER SCIENCE, 1992, 105 (01) : 27 - 56
[6] On termination of logic programs with floating point computations
Serebrenik, A
De Schreye, D
[J]. STATIC ANALYSIS, PROCEEDINGS, 2002, 2477 : 151 - 164
[7] ON THE RELATION OF PROGRAMS AND COMPUTATIONS TO MODELS OF TEMPORAL LOGIC
WOLPER, P
[J]. TEMPORAL LOGIC IN SPECIFICATION, 1989, 398 : 75 - 123
[8] ON THE RELATION OF PROGRAMS AND COMPUTATIONS TO MODELS OF TEMPORAL LOGIC
WOLPER, P
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 398 : 75 - 123
[9] COMPLEXITY OF LOGICAL DECISION-PROBLEMS AND NORMAL FORMS FOR PROLOG-PROGRAMS
BORGER, E
[J]. JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (03) : 835 - 836
[10] THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS
AFRATI, F
PAPADIMITRIOU, CH
[J]. JOURNAL OF THE ACM, 1993, 40 (04) : 891 - 916

← 1 2 3 4 5 →