The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Location-based services in general require information about the position of certain objects. For instance, for a navigation service the position of the user needs to be known. Th...
Hendrik Lemelson, Thomas King, Wolfgang Effelsberg
In recent years, the genetic programming crossover operator has been criticized on both theoretical and empirical grounds. This paper introduces a new crossover operator for linea...
Frank D. Francone, Markus Conrads, Wolfgang Banzha...
In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based...
In this paper we extend the reuse of paths to the shot from a moving light source. In the classical algorithm new paths have to be cast from each new position of a light source. W...