Sciweavers

3470 search results - page 148 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
PPDP
2010
Springer
15 years 4 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
221
Voted
GECCO
2011
Springer
274views Optimization» more  GECCO 2011»
14 years 9 months ago
Fuzzy dynamical genetic programming in XCSF
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...
Richard Preen, Larry Bull
AAAI
2006
15 years 7 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa...
JMLR
2006
112views more  JMLR 2006»
15 years 6 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
171
Voted
FLOPS
1999
Springer
15 years 10 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer