Recent zbMATH articles in MSC 03B35https://www.zbmath.org/atom/cc/03B352021-04-16T16:22:00+00:00WerkzeugComplexity of translations from resolution to sequent calculus.https://www.zbmath.org/1456.030872021-04-16T16:22:00+00:00"Reis, Giselle"https://www.zbmath.org/authors/?q=ai:reis.giselle"Woltzenlogel Paleo, Bruno"https://www.zbmath.org/authors/?q=ai:woltzenlogel-paleo.brunoSummary: Resolution and sequent calculus are two well-known formal proof systems. Their differences make them suitable for distinct tasks. Resolution and its variants are very efficient for automated reasoning and are in fact the theoretical basis of many theorem provers. However, being intentionally machine oriented, the resolution calculus is not as natural for human beings and the input problem needs to be pre-processed to clause normal form. Sequent calculus, on the other hand, is a modular formalism that is useful for analysing meta-properties of various logics and is, therefore, popular among proof theorists. The input problem does not need to be pre-processed, and proofs are more detailed. However, proofs also tend to be larger and more verbose. When the worlds of proof theory and automated theorem proving meet, translations between resolution and sequent calculus are often necessary. In this paper, we compare three translation methods and analyse their complexity.