236 search results - page 4 / 48 » Automated Generation of Interesting Theorems |
JAR
2008
13 years 7 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
KGC
1997
Springer
13 years 11 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
ASM
2010
ASM
13 years 9 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...