MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Contents

Download:
pdf | ps
by Andreas Nonnengart, Christoph Weidenbach, Im Stadtwald, Im Stadtwald
http://www.mpi-sb.mpg.de/%7Eweidenb/publications/handbook99small.ps.gz
Add To MetaCart

Abstract:

Citations

204 Automated Theorem Proving: A Logical Basis – Loveland - 1978
181 On the complexity of derivations in the propositional calculus – Tseitin - 1968
131 A structure-preserving clause form translation – Plaisted, Greenbaum - 1986
86 Theorem Proving via General Matings – Andrews - 1981
67 On Generating Small Clause Normal Forms – Nonnengart, Rock, et al. - 1998
26 Logisch-kombinatorische Untersuchungen "uber die Erf"ullbarkeit oder Beweisbarkeit mathematischer S"atze nebst einem Theoreme "uber dichte Mengen, Viden-skapsselskapets skrifter, I. matematisk-naturvidenskabelig klasse – Skolem - 1920
10 A note on assumptions about skolem functions – Ohlbach, Weidenbach - 1995
7 On the Value of Antiprenexing – Egly - 1994
5 BDDs and automated deduction – Goubault, Posegga - 1994
4 Strong Skolemization. Research Report MPI-I-96-2-010. Saarbrucken: Max-Planck-Institut fur Informatik – Nonnengart - 1996
3 On skolemization and proof complexity', Fundamenta Informaticae 20(4 – Baaz, Leitsch - 1994
3 The Halting Problem: An Automatically Generated Proof – Egly, Rath - 1995
2 1979], A challenge problem for automated theorem provers. The problem was posed at the fourth workshop on automated deduction – Andrews - 1979
2 Wos L.: Challenge problem 1 – Henschen, Lusk, et al. - 1980
1 de la Tour T. [1992], `An optimality result for clause form translation – Boy
1 1992], Relative Complexities of First Order – Eder
1 A BDD-based simpli and skolemization procedure', Logic – Goubault
1 Transformations of formulae for automated reasoning, Diplomarbeit, Max-Planck-Institut fur Informatik – Nonnengart, G - 1995
View or Download | Add to My Collection | Correct Errors