### Citations

52 | Theorems and Algorithms: An Interface between Isabelle and Maple.
- Ballarin
- 1995
(Show Context)
Citation Context ...vant amount of subtasks. Apart from first-order logic theorem proving, the most important reasoning methods being integrated in interactive frameworks are: computer algebra (Harrison and Théry, 1993; =-=Ballarin et al., 1995-=-), model checking (Joyce and Seger, 1994; Owre et al., 1996) and decision procedures (Boyer and Moore, 1988). Each of them is typically applied to some particular domain(s). Computer algebra is incorp... |

39 | PROTEIN: A PROver with a theory extension INterface, in ‘Conference on Automated Deduction
- Baumgartner, Furbach
- 1994
(Show Context)
Citation Context ...ter I.3.14), NQTHM (Boyer and Moore, 1979), and PVS (Owre et al., 1992) for the interactive (or tactical) theorem proving community; and KoMeT (Bibel et al., 1994), Otter (Wos et al., 1992), Protein (=-=Baumgartner and Furbach, 1994-=-), Setheo (Goller et al., 1994), Spass (Weidenbach et al., 1996), and 3TAP (Beckert et al., 1996) for the automated theorem proving community. In this chapter we present a project to integrate interac... |

26 | A completion-based method for mixed universal and rigid Eunification
- Beckert
- 1994
(Show Context)
Citation Context ...ion system that is integrated with an interactive prover to employ efficient equality reasoning techniques. Part of 3TAP is a special equality background reasoner that uses a completion-based method (=-=Beckert, 1994-=-) for solving E-unification problems extracted from tableau branches. This equality reasoner is much more efficient than just including the equality axioms. In addition to the mere efficiency of the t... |

13 | The tableau-based theorem prover 3tap, version 4.0
- Beckert, Hahnle, et al.
- 1996
(Show Context)
Citation Context ... theorem proving community; and KoMeT (Bibel et al., 1994), Otter (Wos et al., 1992), Protein (Baumgartner and Furbach, 1994), Setheo (Goller et al., 1994), Spass (Weidenbach et al., 1996), and 3TAP (=-=Beckert et al., 1996-=-) for the automated theorem proving community. In this chapter we present a project to integrate interactive and automated theorem proving. Its aim is to combine the advantages of the two paradigms. W... |

9 | The even more liberalized δ-rule in free variable Semantic Tableaux, volume 713
- Beckert, Hähnle, et al.
- 1993
(Show Context)
Citation Context ...mple “ground” calculus. But the research in the field of tableaux yielded several improvements. One is a modified δ-rule (δ��� ), which is proven to allow exponential shorter proofs in extreme cases (=-=Beckert et al., 1993-=-). Here, we decided to provide a “ground” δ-rule that corresponds to δ��� . The rule itself has a simple description, but its soundness proof turned out to be difficult. Another improvement of the fre... |

5 |
Linking other theorem provers to HOL using PM: Proof manager
- Archer, Fink
- 1992
(Show Context)
Citation Context ...rder logic. For a discussion of some of the issues that have to be solved for higher-order logic (polymorphism, currying, problems arising from the identification of boolean terms with formulas) see (=-=Archer et al., 1993-=-). The presence of inductive theorems is a fundamental problem. It can be mitigated by adding previously derived (inductive) theorems as lemmas. On the one hand, this reduces the number of theorems wh... |