A NEAR-OPTIMAL METHOD FOR REASONING ABOUT ACTION

被引:81
作者
PRATT, VR
机构
关键词
D O I
10.1016/0022-0000(80)90061-6
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:231 / 254
页数:24
相关论文
共 25 条
[1]  
Basu S. K., 1975, IEEE Transactions on Software Engineering, VSE-1, P339, DOI 10.1109/TSE.1975.6312858
[2]  
Chandra A. K., 1976, 17TH P IEEE S F COMP, P98, DOI DOI 10.1109/SFCS.1976.4
[3]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&
[4]  
Dijkstra E., 1976, DISCIPLINE PROGRAMMI
[5]  
FISCHER MJ, 1977, PROPOSITIONAL DYNAMI
[6]  
FISCHER MJ, 1977, 9TH P ANN ACM S THEO, P286
[7]  
GABBAY DM, 1977, AXIOMATIZATIONS LOGI
[8]   Studies on logical closing. [J].
Gentzen, G .
MATHEMATISCHE ZEITSCHRIFT, 1935, 39 :176-210
[9]   AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J].
HOARE, CAR .
COMMUNICATIONS OF THE ACM, 1969, 12 (10) :576-&
[10]   INTRINSICALLY EXPONENTIAL COMPLEXITY OF CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS [J].
JAZAYERI, M ;
OGDEN, WF ;
ROUNDS, WC .
COMMUNICATIONS OF THE ACM, 1975, 18 (12) :697-706