Sciweavers

95 search results - page 18 / 19
» Reasoning with OWL-DL in Inductive Logic Programming
Sort
View
CSL
2007
Springer
13 years 11 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
ILP
2007
Springer
13 years 11 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...
ILP
1999
Springer
13 years 9 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo
CIE
2008
Springer
13 years 7 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
ICFP
2005
ACM
14 years 4 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...