Sciweavers

185 search results - page 25 / 37
» Induction in an Abstraction Space: A Form of Constructive In...
Sort
View
TLCA
2005
Springer
14 years 1 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
IJCAI
2007
13 years 9 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
ECML
2005
Springer
14 years 1 months ago
Mode Directed Path Finding
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
Irene M. Ong, Inês de Castro Dutra, David Pa...
VMCAI
2009
Springer
14 years 2 months ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari
EWCBR
2004
Springer
14 years 1 months ago
Feature Selection and Generalisation for Retrieval of Textual Cases
Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledge-rich comparison of textual cases remains an important challenge for these systems. How...
Nirmalie Wiratunga, Ivan Koychev, Stewart Massie