-
1
-
-
84879078812
-
Reconciling two views of cryptography (the computational soundness of formal encryption)
-
Proceedings of IFIP International Conference on Theoretical Computer Science (TCS'00), Springer-Verlag
-
M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In Proceedings of IFIP International Conference on Theoretical Computer Science (TCS'00), volume 1872 of Lecture Notes in Computer Science, pp. 3-22. Springer-Verlag, 2000.
-
(2000)
Lecture Notes in Computer Science
, vol.1872
, pp. 3-22
-
-
Abadi, M.1
Rogaway, P.2
-
2
-
-
0000128393
-
On the logic of theory change: Partial meet functions for contraction and revision
-
C. E. Alchourrón, P. Gärdenfors and D. Makinson. On the logic of theory change: partial meet functions for contraction and revision, Journal of Symbolic Logic, 50, 510-530, 1985.
-
(1985)
Journal of Symbolic Logic
, vol.50
, pp. 510-530
-
-
Alchourrón, C.E.1
Gärdenfors, P.2
Makinson, D.3
-
7
-
-
0001997155
-
Non-omniscient belief as context-based reasoning
-
F. Giunchiglia, L. Serafini, E. Giunchiglia, and M. Frixione. Non-omniscient belief as context-based reasoning. In Proceedings of 13th International Joint Conference on Artificial Intelligence (IJCAI'93), pp. 548-554, 1993.
-
(1993)
Proceedings of 13th International Joint Conference on Artificial Intelligence (IJCAI'93)
, pp. 548-554
-
-
Giunchiglia, F.1
Serafini, L.2
Giunchiglia, E.3
Frixione, M.4
-
8
-
-
0026853865
-
A guide to completeness and complexity for modal logics of knowledge and belief
-
J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence, 54, 319-379, 1992.
-
(1992)
Artificial Intelligence
, vol.54
, pp. 319-379
-
-
Halpern, J.Y.1
Moses, Y.2
-
10
-
-
35248868917
-
Modeling adversaries in a logic for reasoning about security protocols
-
Proceedings of Workshop on Formal Aspects of Security (FASec '02)
-
J. Y. Halpern and R. Pucella. Modeling adversaries in a logic for reasoning about security protocols. In Proceedings of Workshop on Formal Aspects of Security (FASec '02), volume 2629 of Lecture Notes in Computer Science, pp. 115-132, 2002.
-
(2002)
Lecture Notes in Computer Science
, vol.2629
, pp. 115-132
-
-
Halpern, J.Y.1
Pucella, R.2
-
12
-
-
84979312929
-
Algebras with a scheme of operators
-
P. J. Higgins. Algebras with a scheme of operators, Mathematische Nachrichten, 27, 115-132, 1963.
-
(1963)
Mathematische Nachrichten
, vol.27
, pp. 115-132
-
-
Higgins, P.J.1
-
17
-
-
0000595575
-
The computational complexity of provability in systems of modal prepositional logic
-
R. E. Ladner. The computational complexity of provability in systems of modal prepositional logic, SIAM Journal on Computing, 6, 467-480, 1977.
-
(1977)
SIAM Journal on Computing
, vol.6
, pp. 467-480
-
-
Ladner, R.E.1
-
20
-
-
0033342013
-
Probabilistic deduction with conditional constraints over basic events
-
T. Lukasiewicz. Probabilistic deduction with conditional constraints over basic events, Journal of Artificial Intelligence Research, 10, 199-241, 1999.
-
(1999)
Journal of Artificial Intelligence Research
, vol.10
, pp. 199-241
-
-
Lukasiewicz, T.1
-
21
-
-
0027578148
-
Automatic recognition of tractability in inference relations
-
D. McAllester. Automatic recognition of tractability in inference relations, Journal of the ACM, 40, 284-303, 1993.
-
(1993)
Journal of the ACM
, vol.40
, pp. 284-303
-
-
McAllester, D.1
-
24
-
-
0000153738
-
Formal theories of knowledge in AI and robotics
-
S. J. Rosenschein. Formal theories of knowledge in AI and robotics, New Generation Computing, 3, 345-357, 1985.
-
(1985)
New Generation Computing
, vol.3
, pp. 345-357
-
-
Rosenschein, S.J.1
-
25
-
-
0030102186
-
Knowledge compilation and theory approximation
-
B. Selman and H. Kautz. Knowledge compilation and theory approximation, Journal of the ACM, 43, 193-224, 1996.
-
(1996)
Journal of the ACM
, vol.43
, pp. 193-224
-
-
Selman, B.1
Kautz, H.2
|