3552 search results - page 283 / 711 » Proof theory in the abstract |
173
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
200
click to vote
FSTTCS
1991
Springer
15 years 10 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
197
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
185
click to vote
ICLP
2010
Springer
15 years 10 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...
178
click to vote
DLOG
2008
15 years 9 months ago
2008
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...