Sciweavers

1302 search results - page 60 / 261
» Free-Style Theorem Proving
Sort
View
FOIS
2001
13 years 9 months ago
A note on proximity spaces and connection based mereology
-- Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann [17] has demonstrated the fruit...
Dimiter Vakarelov, Ivo Düntsch, Brandon Benne...
IJCAI
1997
13 years 9 months ago
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
Jörg Denzinger, Marc Fuchs, Matthias Fuchs
ECCC
2010
79views more  ECCC 2010»
13 years 7 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
ENTCS
2008
87views more  ENTCS 2008»
13 years 7 months ago
Integral of Fine Computable functions and Walsh Fourier series
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
13 years 7 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen