34 search results - page 3 / 7 » Automated Theorem Proving in a Simple Meta-Logic for LF |
CSL
2007
Springer
14 years 4 days ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
CADE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
STOC
1999
ACM
13 years 10 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
CADE
2006
Springer
14 years 6 months ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...