379 search results - page 3 / 76 » Strong reducibility of partial numberings |
EATCS
2000
13 years 7 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
LICS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
PEPM
2007
ACM
14 years 1 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
IBPRIA
2003
Springer
14 years 25 days ago
2003
Springer
In this paper, a new approach to training set size reduction is presented. This scheme basically consists of defining a small number of prototypes that represent all the original ...