|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
~AUMANN, R. J., 1976. Agreeing to disagree. Ann. Stat. 4, 6, 1236 1239.
|
| |
2
|
~CAVE, J. 1983. Learning to agree. Econ. Lett. 12, 147 152.
|
| |
3
|
|
| |
4
|
|
| |
5
|
~FELLER, W. i957. An Introduction to Probab&tv TheoO' and Its Apphcatlons, volume 1. Wfiey, ~New York.
|
| |
6
|
~fISCHER, M. J. AND LADNER, R E., 1979. Propositional dynamic logic of regular programs. J. ~Comput. Svst. Scl. 18, 2, 194-211.
|
| |
7
|
~FISCHER, M. J. AND ZUCK, k. D., 1987. Relatwe knowledge and belief (extended abstract). Tech. ~Rep. YALEU/DCS/TR-589. Yale Univ.
|
| |
8
|
~FISCHER, M. J. AND ZUCK, L. D., 1988. Reasoning about uncertainty in fault-tolerant distributed ~systems. Tech. Rep. YALEU/DCS/TR-643. Yale Univ.
|
| |
9
|
|
| |
10
|
|
| |
11
|
~HALMOS, P., 1950. Measure Theory. Van Nostrand, New York.
|
| |
12
|
~HALPERN, J. Y., 1987. Using reasoning about knowledge to analyze distributed systems. In ~Annual Redew of Computer Science, vol. 2. J. F. Traub, B. J. Grosz, B. W. Lampson, and N. J. ~Nilsson, eds. Annual Reviews Inc., Palo Alto, Calif., pp. 37-68.
|
| |
13
|
~HALPERN, J. Y., 1991. The relationship between knowledge, belief, and certainty. Ann. Math. ~Artif. Int. 4, 301-322.
|
| |
14
|
|
 |
15
|
|
| |
16
|
|
 |
17
|
Joseph Halpern , Yjoram Moses , Mark Tuttle, A knowledge-based analysis of zero knowledge, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.132-147, May 02-04, 1988, Chicago, Illinois, United States
[doi> 10.1145/62212.62224]
|
| |
18
|
|
 |
19
|
|
 |
20
|
|
| |
21
|
~HINTIKKA, J., 1962. Knowledge and Belief: Cornell University Press, Ithaca, NY.
|
| |
22
|
~HUGHES, G. E. AND CRESSWELL, M. J., 1968. An Inu'oduction to Modal Logic. Methuen, London.
|
| |
23
|
~KOZEN, D., 1985. Probabilistic PDL. J. Comput. Syst. Sct. 30, 162-178.
|
| |
24
|
~KRIPKE, S., 1963. A semantical analysis of modal logic. I: Normal modal propositional calculi. Z. ~Math. Logik Grundl. Math. 9, 67-96. (Announced in J. Syrnb. Logic 24, 1959, p. 323.)
|
| |
25
|
~LADNER, R. E., 1977. The computational complexity of provability in systems of modal proposi- ~tional logic. SIAM J. Conlput. 6, 3, 467-480.
|
| |
26
|
~LEHMANN, D. AND SHELAH, S., 1982. Reasoning about time and change. Inf. Control 53, ~165-198.
|
| |
27
|
~LENZEN, W., 1978. Recent work m epistemic logic. Acta Phil. Fen. 30, 1-219.
|
| |
28
|
~MAKINSON, D., 1966. On some completeness theorems in modal logic. Z. Math. Logik Gnmdl. ~Math. 12, 379-384.
|
| |
29
|
~MILLER, D., 1966. A paradox of information. Brit. J. Phil. Sci., 17.
|
| |
30
|
~MONDERER, D. AND SAMET, m., 1989. Approximating common knowledge with common beliefs. ~Games and Economic Behat,ior 1, 170-190.
|
| |
31
|
~MOORE, R. C., 1985. A formal theory of knowledge and action. In Fomlal Theories of the ~Commonsense World, J. Hobbs and R. C. Moore, eds. Ablex Publishing Corp., Norwood, N.J., ~pp. 319-358.
|
| |
32
|
|
| |
33
|
NEVEU, J., 1964. Bases Mathemattques du Calcul des Probabiht~s. Mason.
|
| |
34
|
|
| |
35
|
~PRATt, V. R., 1979. Models of program logics. In Proceedtngs of the 20th IEEE Symposium on ~Foundations of Computer Science. IEEE, New York, pp. 115-122.
|
| |
36
|
~RUSPINI, E. n., 1987. Epistemic logics, probability, and the calculus of evidence. In Proceedings ~of the l Oth International Joint Conference on Artificial Intelligence ( IJCAI-87 ), pp. 924 931.
|
| |
37
|
~SHAFER, G., 1976. A Mathematical Theory of Et~idence. Princeton University Press, Princeton, ~N.J.
|
| |
38
|
~SKYRMS, B., 1980. Higher order degrees of belief. In Prospects for Pragmatism: Essays in Honor of ~F. P. Ramso'. D. H. Mellor, ed., Cambridge University Press, Cambridge, U.K.
|
CITED BY 29
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alberto Finzi , Fiora Pirri, Combining probabilities, failures and safety in robot control, Proceedings of the 17th international joint conference on Artificial intelligence, p.1331-1336, August 04-10, 2001, Seattle, WA, USA
|
|
|
|
INDEX TERMS
Primary Classification:
I.
Computing Methodologies
I.2
ARTIFICIAL INTELLIGENCE
Additional Classification:
F.
Theory of Computation
F.1
COMPUTATION BY ABSTRACT DEVICES
F.4
MATHEMATICAL LOGIC AND FORMAL LANGUAGES
F.4.1
Mathematical Logic
Subjects:
Model theory
G.
Mathematics of Computing
I.
Computing Methodologies
I.2
ARTIFICIAL INTELLIGENCE
I.2.3
Deduction and Theorem Proving
Subjects:
Uncertainty, "fuzzy," and probabilistic reasoning
General Terms:
Languages,
Theory,
Verification
Keywords:
knowledge,
modal logic,
nondeterminism vs. probability,
possible words,
probabilistic common knowledge,
probabilistic knowledge,
reasoning about knowledge and probability
REVIEW
"Calin Lucaciu : Reviewer"
The way toward a model for reasoning about knowledge and
probability begins in this paper with a review of classical
possible-worlds semantics for knowledge. Next, the authors provide an
extended language and a complete axiomatization for know
more...
|