Abstract | ||
---|---|---|
That there exist relationships between Model Elimination and Analytic Tableaux has been known for some time. However, the mapping between these procedures has not been shown explicitly to date. In order to define the mapping between the procedures, we need to use two reduction techniques which avoid the generation of duplicate subtrees in tableaux. By identifying the parallels between the two procedures, we have been able to develop the two procedures, we have been able to develop a technique so that lemmas can be produced as side-effect of closing branches within the tableau. Further, we have developed a control structure for Model Elimination which bears many similarities to that used for analytic tableau. |
Year | Venue | Keywords |
---|---|---|
1998 | AUSTRALIAN COMPUTER JOURNAL | analytic tableaux,model elimination,theorem proving,lemma production |
DocType | Volume | Issue |
Journal | 30 | 1 |
ISSN | Citations | PageRank |
0004-8917 | 0 | 0.34 |
References | Authors | |
1 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jo Coldwell | 1 | 17 | 5.33 |
Graham Wrightson | 2 | 43 | 15.40 |