Ronald Fagin
Joseph Y. Halpern
Moshe Y. Vardi
- 1 BRACHMAN, R., AND LEVESQUE, H. Readings in Knowledge Representation. Morgan- Kaufmann, San Mateo, Calif., 1985. Google Scholar
- 2 CHANDY, K. M., AND MISRA, J. How processes learn. Dist. Comput. I, 1 (t986), 40-52. Google Scholar
- 3 DWORK, C., AND MOSES, Y. Knowledge and common knowledge in a Byzantine environment. I: Crash failures. Inf. Computation 88, 2 (1990), 156-186. Google Scholar
- 4 EMERSON, E.A. Alternative semantics for temporal logics. Theoret. Cornput. Scz. 26 (1983), 121-130.Google Scholar
- 5 FAGIN, R., AND HALPERN, J. Y. Belief, awareness, and limited reasoning. Artif. b~t. 34 (1988), 39-76. Google Scholar
- 6 FAGIN, R., HALPERN, J. Y., AND VARDI, M.Y. What can machines know? On the epistemic properties of machines. In Proceedings of National Conference on Artificial huelligence ( AAAI- 86). 1986, pp. 428-434.Google Scholar
- 7 FAGIN, R., AND VARDI, M.Y. An internal semantics for modal logic. In Proceedmgs of the 17th Annual ACM Symposium on Theory of Computing (Providence, R.I., May 6-8). ACM, New York, 1985, pp. 305-315. Google Scholar
- 8 FAGIN, R., AND VARDI, M.Y. Knowledge and implicit knowledge in a distributed environment. In J. Y. Halpern, ed., Theoretical Aspects" of Reasoning about Knowledge. Morgan-Kaufmann, San Mateo, Calif., 1986, pp. 187-206. Google Scholar
- 9 FISCHER, M. J., AND IMMERMAN, N. Foundations of knowledge for distributed systems. In J. Y. Halpern, ed., Theoretical Aspects of Reasoning about Knowledge. Morgan-Kaufmann, San Mateo, Calif., 1986, pp. 171-186. Google Scholar
- 10 HALPERN, J. Y., AND FAGIN, R. Modelling knowledge and action in distributed systems. Dist. Comput. 3, 4 (t989), 159-179.Google Scholar
- 11 HALPERN, J. Y., AND MOSES, Y. 0. Knowledge and common knowledge in a distributed environment. J. ACM 37, 3 (July 1990), 549-587. Google Scholar
- 12 HALPERN, J. Y., AND MOSES, Y.O. A guide to the modal logics of knowledge and belief. In Proceedings of the 9th International Joint Conference on Artificial h~teIligence (1JCAI-85). 1985, pp. 480-490. (Also, Artif. Int., to appear.)Google Scholar
- 13 HALPERN, J. Y., AND VARDI, M.Y. The complexity of reasoning about knowledge and time. I: Lower bounds. J. Comput. Syst. Sci. 38 (1989), 195-237. Google Scholar
- 14 HALPERN, J. Y., AND VARDI, M.Y. Reasoning about knowledge and time in asynchronous systems. In Proceedings of the 20th Anmtal ACM Symposium on Theory of Computing (Chicago, ill. May 2-4). ACM, New York, 1988, pp. 53-65. Google Scholar
- 15 HINTIKKA, J. Knowledge and Belief. Cornell University Press, Ithaca, N.Y., t962.Google Scholar
- 16 KRIPKE, S. Semantical analysis of modal logic. Z. Math. Log. Grund. Math. 9 (1963), 67-96.Google Scholar
- 17 LADNER, R., AND REIF, J. H. The logic of distributed protocols. In J. Y. Halpern, ed., Theoretical Aspects of Reasoning about Knowledge. Morgan-Kaufmann, San Mateo, Calif., 1986, pp. 207-221. Google Scholar
- 18 LEHMANN, D. Knowledge, common knowledge, and related puzzles. In Proceedings of the 3rd Annual ACM Symposium on Pt4ncipIes of Distributed Computing. ACM, New York, 1984, pp. 467-480. Google Scholar
- 19 LEVESOUV,, H. A logic of implicit and explicit belief. In Proceedings of the National Conference on Artificial hzteIligence ( AAAI-84). 1984, pp. 198-202.Google Scholar
- 20 MAKINSON, D. On some completeness theorems in modal logic. Z. Math. Log. Grund. Math. 12 (1966), 379-384.Google Scholar
- 21 MOORE, R.C. Reasoning about knowledge and action. Tech. Note 191. Artificial intelligence Center, SRI International, Menlo Park, Calif., 1980.Google Scholar
- 22 MOSES, Y., AND TUTTLE, M. Programming simultaneous actions using common knowledge. AIgorithmtca 3 (1988), 121-169.Google Scholar
- 23 PARIKH, R., AND RAMANUJAM, R. Distributed processing and the logic of knowledge. In Proceedings of the Workshop on Logics of Programs (Brooklyn, N.Y., June). Lecture Notes in Computer Science, vol. 193. Springer-Verlag, New York, 1985, pp. 256-268. Google Scholar
- 24 PRATT, V.R. Process logic. In Proceedings of tlze 6th Annztal ACM Symposmm on Prmctples of Programming Languages. (San Antanio, Tex., Jan. 29-31). ACM, New York, 1979, pp. 93-100. Google Scholar
- 25 ROSENSCHEIN, S. J. Formal theories of knowledge in AI and robotics. New Generation Comput. 3 (1985) 345-357. Google Scholar
- 26 ROSENSCHF, IN, S. J., AND KAEU3LING, L.P. The synthesis of digital machines with provable epistemlc properties. In J. Y. Halpern, ed., Theorencal Aspects of Reasonmg about Ka~owledge. Morgan-Kaufmann, San Mateo, Calif., 1986, pp. 83-98. Google Scholar
- 27 SAVAGE, k.J. The Foundations of Statistics. Wiley, New York, 1954.Google Scholar
Index Terms
- What can machines know?: On the properties of knowledge in distributed systems
Recommendations
Wavelet twin support vector machines based on glowworm swarm optimization
Twin support vector machine is a machine learning algorithm developing from standard support vector machine. The performance of twin support vector machine is always better than support vector machine on datasets that have cross regions. Recently ...
PAC-Bayes bounds for twin support vector machines
Twin support vector machines are regarded as a milestone in the development of support vector machines. Compared to standard support vector machines, they learn two nonparallel hyperplanes rather than one as in standard support vector machines for ...
Multitask centroid twin support vector machines
Twin support vector machines are a recently proposed learning method for binary classification. They learn two hyperplanes rather than one as in conventional support vector machines and often bring performance improvements. However, an inherent shortage ...
Comments