4 search results - page 1 / 1 » Proving Harder Theorems by Axiom Reduction |
69
Voted
FLAIRS
2003
14 years 11 months ago
2003
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
93
Voted
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
APAL
2005
14 years 9 months ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
CADE
2008
Springer
15 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...