Sciweavers

1071 search results - page 12 / 215
» Programming with enumerable sets of structures
Sort
View
ECAI
2010
Springer
13 years 11 months ago
On Testing Answer-Set Programs
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...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...
CIE
2009
Springer
14 years 4 months ago
Equivalence Relations on Classes of Computable Structures
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...
Ekaterina B. Fokina, Sy-David Friedman
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 4 months ago
Boosting Relational Sequence Alignments
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
IJRR
2010
117views more  IJRR 2010»
13 years 7 months ago
Generalizing Dubins Curves: Minimum-time Sequences of Body-fixed Rotations and Translations in the Plane
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...
Andrei A. Furtuna, Devin J. Balkcom
COR
2006
98views more  COR 2006»
13 years 9 months ago
Exploiting semidefinite relaxations in constraint programming
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...
Willem Jan van Hoeve