2432 search results - page 49 / 487 » Cryptographic logical relations |
KI
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset” operator defined on the intersection between epistemic and temporal rela...
LPNMR
1999
Springer
15 years 2 months ago
1999
Springer
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Ford has introduced a non-monotonic logic, System LS, inspired by an empirical study of human non-monotonic reasoning. We define here a defeasible logic FDL based on Ford’s logi...
TCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...