58 search results - page 5 / 12 » Normal Proofs in Intruder Theories |
KI
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
101
click to vote
ENTCS
2002
14 years 11 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
COMPSEC
2004
14 years 11 months ago
2004
Identifying the intentions or attempts of the monitored agents through observations is very vital in computer network security. In this paper, a plan recognition method for predict...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
107
click to vote
LFCS
2009
Springer
15 years 6 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...