2694 search results - page 114 / 539 » Frege's New Science |
179
click to vote
DIS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
163
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
172
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
165
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
145
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...