We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
— In this paper, we use Genetic Programming (GP) to define a set of transforms on the space of greyscale images. The motivation is to allow an evolutionary algorithm means of tr...
Taras Kowaliw, Wolfgang Banzhaf, Nawwaf N. Kharma,...
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...