Fakult at f ur Informatik
Download:
|
|
by Interner Bericht, A-ordered Tableaux, Reiner Hahnle, Reiner Hahnle, Stefan Klingenbeck, Stefan Klingenbeck
ftp://ftp.ira.uka.de/pub/uni-karlsruhe/papers/techreports/1995/1995-26.ps.gz
Add To MetaCart
Abstract:
Copyright notice This document has been submitted for publication elsewhere and will be copyrighted when accepted.
Citations
| 340 | First-Order Logic and Automated Theorem Proving (2 nd ed – Fitting - 1996 |
| 210 | First-order logic – Smullyan - 1968 |
| 187 | Rewrite-based equational theorem proving with selection and simplification – Bachmair, Ganzinger - 1994 |
| 142 | Automated Theorem Proving – Bibel - 1987 |
| 37 | Dissolution: making paths vanish – Murray, Rosenthal - 1993 |
| 24 | leanT A P : lean, tableau-based theorem proving – Beckert, Posegga - 1994 |
| 19 | The Many-Valued Tableau-Based Theorem Prover 3TAP – Hahnle, Beckert, et al. - 1994 |
| 17 | First-order calculi and proof procedures for automated deduction – Letz - 1993 |
| 11 | SETHEO: A high-perfomance theorem prover – Letz, Schumann, et al. - 1992 |
| 8 | Theorem proving through general matings – Andrews - 1981 |
| 4 | Semantic tableaux with ordering restrictions – Klingenbeck, Hahnle - 1994 |
