A NEAR-OPTIMAL METHOD FOR REASONING ABOUT ACTION

[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]. 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]. MATHEMATISCHE ZEITSCHRIFT, 1935, 39 : 176 - 210

[9] AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J]. COMMUNICATIONS OF THE ACM, 1969, 12 (10) : 576 - &

[10] INTRINSICALLY EXPONENTIAL COMPLEXITY OF CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (12) : 697 - 706

[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]. 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]. MATHEMATISCHE ZEITSCHRIFT, 1935, 39 : 176 - 210

[9] AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J]. COMMUNICATIONS OF THE ACM, 1969, 12 (10) : 576 - &

[10] INTRINSICALLY EXPONENTIAL COMPLEXITY OF CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (12) : 697 - 706