123 search results - page 4 / 25 » Interpolation in Valiant's theory |
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
105
click to vote
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...
92
Voted
SRDS
1998
IEEE
15 years 1 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
BC
2006
14 years 9 months ago
2006
We show how a general quantitative theory of neural computation can be used to explain two recent experimental findings in neuroscience. The first of these findings is that in hum...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...