Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used in this process is one of the key factors for the performance of the system. A new heuristic for answer set programmin...

Adaptive critic methods have common roots as generalizations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, nonlinear and nonstationary environments. In this study, a novel probabilistic dual heuristic programming (DHP) based adaptive critic controller is proposed...

Heuristic search algorithms can nd solutions that take the form of a simple path (A*), a tree or an acyclic graph (AO*). We present a novel generalization of heuristic search (called LAO*) that can nd solutions with loops, that is, solutions that take the form of a cyclic graph. We show that it can be used to solve Markov decision problems without evaluating the entire state space, giving it an...

Minimum-weight arborescence problems have recently enjoyed an increased attention due to their relation to imporant problems in computer vision. A prominent example is the automated reconstruction of consistent tree structures from noisy images. In this paper, we first propose a heuristic for tackling the minimum-weight rooted arborescence problem. Moreover, we propose an ant colony optimizatio...

Heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree or acyclic graph (AO*). We present a novel generalization of heuristic search (called LAO*) that can find solutions with loops, that is, solutions that take the form of a cyclic graph. We show that it can be used to solve Markov decision problems without evaluating the entire state space, giving it a...

The continuous speech recognition problem is usually modeled as a search for the best path in a network of transitions between states. A full search can be very expensive in terms of computation and storage requirements. By adopting a segment based rather than a frame based approach, one can already obtain a reduction of these requirements, but this may still be insuucient to allow for real tim...