2962 search results - page 396 / 593 » Reasoning on Association Rules |
160
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
201
click to vote
CSL
2000
Springer
15 years 11 months ago
2000
Springer
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
187
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
176
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
216
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...