Sciweavers

179 search results - page 5 / 36
» The proof of Hermann's conjecture
Sort
View
CADE
2012
Springer
11 years 10 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
CADE
2007
Springer
14 years 1 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
ECCC
2010
95views more  ECCC 2010»
13 years 4 months ago
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, ...
CORR
2007
Springer
72views Education» more  CORR 2007»
13 years 7 months ago
A Proof of a Recursion for Bessel Moments
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
Jonathan M. Borwein, Bruno Salvy