Sciweavers

23 search results - page 4 / 5
» On Avoiding Redundancy in Inductive Logic Programming
Sort
View
ILP
2007
Springer
14 years 1 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
JASIS
2000
143views more  JASIS 2000»
13 years 7 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
VEE
2005
ACM
167views Virtualization» more  VEE 2005»
14 years 27 days ago
An execution layer for aspect-oriented programming languages
Language mechanisms deserve language implementation effort. While this maxim has led to sophisticated support for language features specific to object-oriented, functional and lo...
Michael Haupt, Mira Mezini, Christoph Bockisch, To...
PPDP
2004
Springer
14 years 21 days ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
POPL
2010
ACM
14 years 4 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts