82 search results - page 9 / 17 » Inductive Proofs of Computational Secrecy |
125
Voted
EUROGP
2001
Springer
15 years 8 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
125
Voted
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
136
Voted
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
121
Voted
BIRTHDAY
2007
Springer
15 years 10 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
180
Voted
TLCA
1993
Springer
15 years 7 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...