1322 search results - page 80 / 265 » Unsound Theorem Proving |
AISC
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...