ON THE COMPUTATIONAL-COMPLEXITY OF SATISFIABILITY IN PROPOSITIONAL LOGICS OF PROGRAMS

被引：2

|

作者：

CHLEBUS, BS

机构：

来源：

THEORETICAL COMPUTER SCIENCE | 1982年 / 21卷 / 02期

关键词：

D O I：

10.1016/0304-3975(89)90083-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：179 / 212

页数：34

相关论文

共 50 条

[1] THE COMPUTATIONAL-COMPLEXITY OF THE SATISFIABILITY OF MODAL HORN CLAUSES FOR MODAL PROPOSITIONAL LOGICS
CHEN, CC
LIN, IP
THEORETICAL COMPUTER SCIENCE, 1994, 129 (01) : 95 - 121
[2] THE COMPUTATIONAL-COMPLEXITY OF PROPOSITIONAL STRIPS PLANNING
BYLANDER, T
ARTIFICIAL INTELLIGENCE, 1994, 69 (1-2) : 165 - 204
[3] THE COMPUTATIONAL-COMPLEXITY OF SATISFIABILITY OF TEMPORAL HORN FORMULAS IN PROPOSITIONAL LINEAR-TIME TEMPORAL LOGIC
CHEN, CC
LIN, IP
INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 131 - 136
[4] ON COMPUTATIONAL-COMPLEXITY OF PROLOG PROGRAMS
DIKOVSKY, AJ
THEORETICAL COMPUTER SCIENCE, 1993, 119 (01) : 63 - 102
[5] ON 4 LOGICS OF PROGRAMS AND COMPLEXITY OF THEIR SATISFIABILITY PROBLEMS - EXTENDED ABSTRACT
CHLEBUS, BS
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 148 : 98 - 107
[6] PROPOSITIONAL CALCULI OF TERM SATISFIABILITY AND PROCESS LOGICS
KNAST, R
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 118 - 126
[7] Propositional default logics made easier: computational complexity of model checking
Baumgartner, R
Gottlob, G
THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 591 - 627
[8] AN OVERVIEW OF COMPUTATIONAL-COMPLEXITY
COOK, SA
COMMUNICATIONS OF THE ACM, 1983, 26 (06) : 401 - 408
[9] AMORTIZED COMPUTATIONAL-COMPLEXITY
TARJAN, RE
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02): : 306 - 318
[10] THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION
BYLANDER, T
ALLEMANG, D
TANNER, MC
JOSEPHSON, JR
ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) : 25 - 60

← 1 2 3 4 5 →