Complete axiomatizations for reasoning about knowledge and time

被引:85
作者
Halpern, JY [1 ]
Van der Meyden, R
Vardi, MY
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[2] IBM Corp, Almaden Res Ctr, San Jose, CA USA
[3] Univ New S Wales, Sch Engn & Comp Sci, Sydney, NSW 2052, Australia
[4] Rice Univ, Dept Comp Sci, Houston, TX 77005 USA
关键词
complete axiomatizations; knowledge; common knowledge; temporal logic; epistemic logic;
D O I
10.1137/S0097539797320906
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters regarding the interaction of knowledge with time and regarding the language used. All the logics considered involve the discrete time linear temporal logic operators "next" and "until" and an operator for the knowledge of each of a number of agents. Both the single-agent and multiple-agent cases are studied: in some instances of the latter there is also an operator for the common knowledge of the group of all agents. Four different semantic properties of agents are considered: whether they (i) have a unique initial state, (ii) operate synchronously, (iii) have perfect recall, and (iv) learn. The property of no learning is essentially dual to perfect recall. Not all settings of these parameters lead to recursively axiomatizable logics, but sound and complete axiomatizations are presented for all the ones that do.
引用
收藏
页码:674 / 703
页数:30
相关论文
共 18 条
[1]  
Fagin R., 1995, Reasoning About Knowledge, DOI DOI 10.7551/MITPRESS/5803.001.0001
[2]  
FAGIN R, 1991, J ACM, V91, P382
[3]  
Gabbay D., 1980, P 7 ACM S PRINC PROG, P163, DOI DOI 10.1145/567446.567462
[4]  
Halpern J. Y., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P53, DOI 10.1145/62212.62218
[5]  
Halpern J Y, 1986, P 18 ACM S THEOR COM, P304, DOI DOI 10.1145/12130.12161
[6]   A GUIDE TO COMPLETENESS AND COMPLEXITY FOR MODAL-LOGICS OF KNOWLEDGE AND BELIEF [J].
HALPERN, JY ;
MOSES, Y .
ARTIFICIAL INTELLIGENCE, 1992, 54 (03) :319-379
[7]   THE COMPLEXITY OF REASONING ABOUT KNOWLEDGE AND TIME .1. LOWER BOUNDS [J].
HALPERN, JY ;
VARDI, MY .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 38 (01) :195-237
[8]  
HALPERN JY, 1988, 6097 IBM
[9]  
Hintikka J., 1962, Knowledge and Belief
[10]   AN ELEMENTARY PROOF OF THE COMPLETENESS OF PDL [J].
KOZEN, D ;
PARIKH, R .
THEORETICAL COMPUTER SCIENCE, 1981, 14 (01) :113-118