The number of ontologies publicly available and accessible through the web has increased in the last years, so that the task of finding similar terms1 among these structures becom...
This work presents a new algorithm, called Heuristically Accelerated Q–Learning (HAQL), that allows the use of heuristics to speed up the well-known Reinforcement Learning algori...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...