4617 search results - page 389 / 924 » Automation of Diagrammatic Reasoning |
170
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
144
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
141
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
152
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
146
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...