THE COMPLEXITY OF REASONING ABOUT KNOWLEDGE AND TIME .1. LOWER BOUNDS

被引：122

作者：

HALPERN, JY

VARDI, MY

机构：

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1989年 / 38卷 / 01期

关键词：

D O I：

10.1016/0022-0000(89)90039-1

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：195 / 237

页数：43

共 43 条

[1]

Abrahamson K. R., 1980, THESIS U WASHINGTON

[2]

[Anonymous], 1985, FORMAL THEORIES COMM

[3] ALTERNATION [J].

CHANDRA, AK ;

KOZEN, DC ;

STOCKMEYER, LJ .

JOURNAL OF THE ACM, 1981, 28 (01) :114-133

[4] HOW PROCESSES LEARN [J].

CHANDY, KM ;

MISRA, J .

DISTRIBUTED COMPUTING, 1986, 1 (01) :40-52

[5]

DWORK C, 1986, THEORETICAL ASPECTS, P149

[6] SOMETIMES AND NOT NEVER REVISITED - ON BRANCHING VERSUS LINEAR TIME TEMPORAL LOGIC [J].

EMERSON, EA ;

HALPERN, JY .

JOURNAL OF THE ACM, 1986, 33 (01) :151-178

[7] USING BRANCHING TIME TEMPORAL LOGIC TO SYNTHESIZE SYNCHRONIZATION SKELETONS [J].

EMERSON, EA ;

CLARKE, EM .

SCIENCE OF COMPUTER PROGRAMMING, 1982, 2 (03) :241-266

[8] ALTERNATIVE SEMANTICS FOR TEMPORAL LOGICS [J].

EMERSON, EA .

THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) :121-130

[9] DECISION PROCEDURES AND EXPRESSIVENESS IN THE TEMPORAL LOGIC OF BRANCHING TIME [J].

EMERSON, EA ;

HALPERN, JY .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :1-24

[10]

Fagin R., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P268, DOI 10.1109/SFCS.1984.715925

← 1 2 3 4 5 →