4126 search results - page 507 / 826 » Set based logic programming |
117
click to vote
APAL
2010
15 years 3 months ago
2010
First order reasoning about hyperintegers can prove things about sets of integers. In the author's paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic L...
129
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
142
click to vote
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
137
Voted
WILF
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper we propose a representation for 13 relation...
121
click to vote
FLAIRS
2007
15 years 6 months ago
2007
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....