Sciweavers

62 search results - page 4 / 13
» On a Generalisation of Herbrand's Theorem
Sort
View
BIRTHDAY
1991
Springer
13 years 11 months ago
Modal Logic Should Say More Than It Does
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
Melvin Fitting
AML
2005
91views more  AML 2005»
13 years 7 months ago
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced b...
Agata Ciabattoni
JMLR
2002
115views more  JMLR 2002»
13 years 7 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
CEC
2005
IEEE
14 years 1 months ago
Theoretical analysis of generalised recombination
In this paper we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous crossover, inversion, gene duplication, gene d...
Riccardo Poli, Christopher R. Stephens
ISCI
2007
135views more  ISCI 2007»
13 years 7 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape