425 search results - page 16 / 85 » The TPS Theorem Proving System |
100
click to vote
JSYML
2007
14 years 9 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
JUCS
2010
14 years 4 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
CADE
2008
Springer
15 years 10 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...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
127
click to vote
LPAR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...