1410 search results - page 124 / 282 » Proving theorems by reuse |
129
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
263
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
163
click to vote
TACAS
2009
Springer
16 years 22 days ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
159
click to vote
CONTEXT
1999
Springer
15 years 10 months ago
1999
Springer
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...
186
click to vote
AIMSA
1998
Springer
15 years 10 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...