314 search results - page 33 / 63 » Compactness Properties for Stable Semantics of Logic Program... |
LOPSTR
2001
Springer
15 years 1 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
ENC
2005
IEEE
15 years 3 months ago
2005
IEEE
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...
110
click to vote
CADE
1992
Springer
15 years 1 months ago
1992
Springer
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
88
Voted
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...