290 search results - page 15 / 58 » Theorem Proving Using Lazy Proof Explication |
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
CAS
1999
14 years 9 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
ENTCS
2007
14 years 9 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
86
Voted
JAR
1998
14 years 9 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...