A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Filters
On semantic resolution with lemmaizing and contraction and a formal treatment of caching
1998
New generation computing
In this work we show that lemmaizing and contraction can coexist in the framework of semantic resolution. ...
On the lemmaizing side, we define two meta-level inference rules for lemmaizing in semantic resolution, one producing unit lemmas and one producing non-unit lemmas, and we prove their soundness. ...
Acknowledgements We would like to thank Mark Stickel for answering our questions on caching in model elimination. ...
doi:10.1007/bf03037315
fatcat:zpto4ry2ebaktamirnoxoywyhq
On semantic resolution with lemmaizing and contraction
[chapter]
1996
Lecture Notes in Computer Science
In this work we show that lemmaizing and contraction can coexist in the framework of semantic resolution. ...
On the lemmaizing side, we define two meta-level inference rules for lemmaizing in semantic resolution, one for unit and one for non-unit lemmas, and we prove their soundness. ...
Acknowledgements We would like to thank Mark Stickel for answering our questions on caching in model elimination. ...
doi:10.1007/3-540-61532-6_32
fatcat:i2hiz26lmzaqdmeck3nyuceltu
A Taxonomy of Theorem-Proving Strategies
[chapter]
1999
Lecture Notes in Computer Science
For this purpose, a formal notion of search plan is given and shown to apply to all classes of strategies. ...
This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. ...
A general treatment of lemmatization in supported strategies, covering lemmatization in model elimination as a special case, was given in [38] : it includes a formalization of caching and depth-dependent ...
doi:10.1007/3-540-48317-9_3
fatcat:kax5uhmf5ne2zeyzbu4g4ykxbu
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
2005
Journal of symbolic computation
We conclude with a discussion comparing the marked search-graphs for tableaux, linear resolution, and ordering-based strategies, showing how this search model applies across these classes of strategies ...
Then, we apply this analysis to measure the effects of regularity and lemmatization by folding-up on search complexity, by comparing the bounded search spaces of strategies with and without these features ...
the College of Liberal Arts and Sciences with a Dean Scholar Award. ...
doi:10.1016/j.jsc.2004.11.001
fatcat:dszqocun3ncc3oxfgy64i7eahm
Part of the Computer Sciences Commons Recommended Citation Fuchs, Alexander
2009
unpublished
First, we lift a further crucial ingredient of SAT and SMT solvers, lemma-learning, to Darwin and evaluate its benefits. ...
Satisfiability Module Theories (SMT) is a set of logics which extend propositional logic with theories relevant for specific application domains. ...
The only approaches we are aware of have been formulated for the model elimination calculus. One of them is described in [2] and consists of the "caching" and "lemmaizing" techniques. ...
fatcat:mkq2hhiygff5jeb4op62peyxzq