Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
This paper presents the minimum-time sequences of rotations and translations that connect two configurations of a rigid body in the plane. The configuration of the body is its pos...
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...