2076 search results - page 278 / 416 » Functional logic overloading |
132
Voted
AAAI
2012
13 years 5 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
134
click to vote
SIGSOFT
2002
ACM
16 years 3 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
116
click to vote
CCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
143
click to vote
KES
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
154
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...