1302 search results - page 102 / 261 » Free-Style Theorem Proving |
139
click to vote
CORR
2012
Springer
14 years 5 days ago
2012
Springer
This paper examines sparse grid quadrature on weighted tensor products (wtp) of reproducing kernel Hilbert spaces on products of the unit sphere S2 . We describe a wtp quadrature ...
152
click to vote
CADE
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
130
click to vote
JSC
2008
15 years 4 months ago
2008
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
125
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
140
click to vote
FTRTFT
1998
Springer
15 years 8 months ago
1998
Springer
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...