Sciweavers

68 search results - page 12 / 14
» Mathematical Induction in Otter-Lambda
Sort
View
89
Voted
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
15 years 10 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
98
Voted
ICFP
2005
ACM
15 years 9 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
78
Voted
ALT
2005
Springer
15 years 6 months ago
Non U-Shaped Vacillatory and Team Learning
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
Arnold Beckmann
MLQ
2007
90views more  MLQ 2007»
14 years 9 months ago
Kripke submodels and universal sentences
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...