10 search results - page 1 / 2 » Caching and Lemmaizing in Model Elimination Theorem Provers |
CADE
1992
Springer
13 years 9 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
NGC
1998
Springer
13 years 4 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
CADE
2006
Springer
14 years 5 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...
ACSC
2004
IEEE
13 years 8 months ago
2004
IEEE
We have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have inve...
ICFEM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...