4617 search results - page 388 / 924 » Automation of Diagrammatic Reasoning |
146
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibilit...
189
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
165
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
160
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
195
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...