Sciweavers

1131 search results - page 61 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
AGP
1997
IEEE
14 years 21 days ago
An Algorithm for Learning Abductive Rules
We propose an algorithm for learning abductive logic programs from examples. We consider the Abductive Concept Learning framework, an extension of the Inductive Logic Programming ...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
ILP
2007
Springer
14 years 2 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
14 years 28 days ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
JSAI
2005
Springer
14 years 2 months ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
FROCOS
2005
Springer
14 years 2 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi