MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

On Generating Small Clause Normal Forms (1998) [69 citations — 2 self]

Abstract:

In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and refined Skolemization methods. We illustrate their effect on various examples. By an exhaustive experiment of all first-order TPTP problems, it shows that our clause normal form transformation yields fewer clauses and fewer literals than the methods known and used so far. This often allows for exponentially shorter proofs and, in some cases, it makes it even possible for a theorem prover to find a proof where it was unable to do so with more standard clause normal form transformations. 1

Citations

206 Automated Theorem Proving: A Logical Basis – Loveland - 1978
198 On the Complexity of Derivations in Propositional Calculus – Tseitin - 1968
120 A structure-preserving clause form translation – Plaisted, Greenbaum - 1986
90 The TPTP problem library – Suttner, Sutcliffe - 1995
88 Seventy-five problems for testing automatic theorem provers – Pelletier - 1986
87 Theorem proving via general matings – Andrews - 1981
49 SPASS & FLOTTER, version 0.42 – Weidenbach, Gaede, et al. - 1996
28 Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen. Skrifter utgit av Videnskabsselskapet i – Skolem - 1920
20 Integration of automated and interactive theorem proving in ilf – Dahn, Gehne, et al. - 1997
20 On the efficiency of subsumption algorithms – Gottlob, Leitsch - 1985
20 Relative Complexities of First Order Calculi – Eder - 1992
18 de la Tour. An optimality result for clause form translation – Boy - 1992
10 On the Practical Value of Different Definitional Translations to Normal Form – EGLY, T - 1996
9 A note on assumptions about skolem functions – Ohlbach, Weidenbach - 1995
6 On the Value of Antiprenexing – Egly - 1994
5 BDDs and automated deduction – Goubault, Posegga - 1994
5 Strong Skolemization. Research Report MPI-I-96-2-010. Saarbrucken: Max-Planck-Institut fur Informatik – Nonnengart - 1996
3 The Formulation of the Halting Problem is Not Suitable for Describing the Halting Problem. Association for Automated Reasoning Newsletter – Dafa - 1994
3 An Erratum for Some Errata to Automated Theorem Proving Problems. Association for Automated Reasoning Newsletter, 31:8--14 – Pelletier, Sutcliffe - 1995
3 On skolemization and proof complexity', Fundamenta Informaticae 20(4 – Baaz, Leitsch - 1994
2 Strong Skolemization – Nonnengart - 1996
2 Transformations of First-Order Formulae for Automated Reasoning. Diplomarbeit, Max-Planck-Institut fur Informatik – Rock - 1995
2 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 The Halting Problem: An Automatically Generated Proof – Egly, Rath - 1995
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