3353 search results - page 243 / 671 » Laver and set theory |
173
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
161
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
188
click to vote
MFCS
2007
Springer
16 years 21 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
180
click to vote
UM
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we focus on the challenge that users face in processing messages on the web posted in participatory media settings, such as blogs. It is desirable to recommend to us...
164
click to vote
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...