A LOGIC TO REASON ABOUT LIKELIHOOD

被引:36
作者
HALPERN, JY
RABIN, MO
机构
[1] HEBREW UNIV JERUSALEM,DEPT MATH,JERUSALEM,ISRAEL
[2] HARVARD UNIV,AIKEN COMPUTAT LAB,CAMBRIDGE,MA 02138
关键词
D O I
10.1016/0004-3702(87)90093-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
23
引用
收藏
页码:379 / 405
页数:27
相关论文
共 23 条
[1]  
Cresswell M., 1968, INTRO MODAL LOGIC
[2]  
DOYLE J, 1983, CMUCS83114 CARN U TE
[3]   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
[4]   PROPOSITIONAL DYNAMIC LOGIC OF REGULAR PROGRAMS [J].
FISCHER, MJ ;
LADNER, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :194-211
[5]   QUALITATIVE PROBABILITY AS AN INTENSIONAL LOGIC [J].
GARDENFORS, P .
JOURNAL OF PHILOSOPHICAL LOGIC, 1975, 4 (02) :171-185
[6]  
Halpern Joseph Y., 1985, P 9 INT JOINT C ART, P480
[7]  
HALPERN JY, 1984, P 1984 AAAI C AAAI M, P137
[8]   AN ELEMENTARY PROOF OF THE COMPLETENESS OF PDL [J].
KOZEN, D ;
PARIKH, R .
THEORETICAL COMPUTER SCIENCE, 1981, 14 (01) :113-118
[9]  
Luby M., 1983, 24th Annual Symposium on Foundations of Computer Science, P11, DOI 10.1109/SFCS.1983.25
[10]  
MANNA Z, 1979, 6TH P INT C AUT LANG, P385