Sciweavers

557 search results - page 26 / 112
» Useful Transformations in Answer set programming
Sort
View
SOFSEM
2007
Springer
14 years 2 months ago
Fast Approximate Point Set Matching for Information Retrieval
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...
Raphaël Clifford, Benjamin Sach
RULEML
2004
Springer
14 years 1 months ago
Semantic Web Reasoning with Conceptual Logic Programs
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
CEC
2009
IEEE
14 years 2 months ago
Evolving novel image features using Genetic Programming-based image transforms
— 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,...
CLIMA
2004
13 years 9 months ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
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...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
BIRTHDAY
2010
Springer
13 years 9 months ago
Thirteen Definitions of a Stable Model
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...
Vladimir Lifschitz