Logic for Programming, Artificial Intelligence, and Reasoning
暂无分享,去创建一个
The aim of this paper is to summarize and analyze some results obtained in 2000–2001 about decidable and undecidable fragments of various first-order temporal logics, give some applications in the field of knowledge representation and reasoning, and attract the attention of the ‘temporal community’ to a number of interesting open problems.
[1] Andrzej Szalas,et al. Incompleteness of First-Order Temporal Logic with Until , 1988, Theor. Comput. Sci..
[2] Frank Wolter,et al. Modal Description Logics: Modalizing Roles , 1999, Fundam. Informaticae.
[3] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .