An approach to analytic learning is described that searches for accurate entailments of a Horn Clause domain theory. A hill-climbing search, guided by an information based evaluation function, is performed by applying a set of operators that derive frontiers from domain theories. The analytic learning system is one component of a multi-strategy relational learning system. We compare the accurac...

We implemented variations on the Self-Organizing Distinctive State Abstraction model for robot state-discretization and task-learning in a Khepera robot. We conclude that hill-climbing as implementd in [5] is detrimental in embodied robots. Because the ultimate goal of developmental systems is intelligent, embodied robots, we believe that implementation in physical robots is an important test o...

<p>In combinatorial testing development, the fabrication of covering arrays is key challenge by multiple aspects that influence it. A wide range problems can be solved using metaheuristic and greedy techniques. Combining technique utilizing a search like hill climbing (HC), produce feasible results for tests. Methods based on metaheuristics are used to deal with tuples may left after redu...

First-order learning systems (e.g., FOlL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and cros...

First-order learning systems (e.g., FOIL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and cros...

What remains after individuals encounter solutions to insight problems determines whether they can solve the same or similar problems on another occasion. We propose that insight problems are amenable to re-solving if they allow the recoding of a single and executable solution principle. Analysis of non-naïve participants tackling the nine-dot problem showed that many recalled only part of the ...

Search strategy is an important component of any system that uses autonomous agents to detect and neutralize mines. We describe a simple and efficient search strategy derived from research on the adaptive spatial behavior of animals. Electromagnetic sensor data are processed to obtain a discrete spatial target distribution. The target distribution is used as input for a dynamic diffusion proces...

In previous experiments 4] 5] evolution of variable length mathematical expressions containing input variables was found to be useful in nding learning rules for simple and hard supervised tasks. However, hard learning problems required special attention in terms of their need for larger size codings of the potential solutions and their ability of generalisation over the testing set. This paper...

Cinque (2002) examines those transparency effects that have been claimed to point to the existence of restructuring in French and concludes that quantifier and adverb climbing depend not on restructuring but, rather, on an irrealis context. In this paper, we show that restructuring does not play an active role in explaining the existence of en `of-it' and y `there' climbing or long movement in ...