DeepAI AI Chat

Generating Schemata of Resolution Proofs

06/14/2011

∙

by Vincent Aravantinos, et al.

∙

∙

Two distinct algorithms are presented to extract (schemata of) resolution proofs from closed tableaux for propositional schemata. The first one handles the most efficient version of the tableau calculus but generates very complex derivations (denoted by rather elaborate rewrite systems). The second one has the advantage that much simpler systems can be obtained, however the considered proof procedure is less efficient.

Vincent Aravantinos
8 publications
Nicolas Peltier
18 publications

page 1

page 2

page 3

page 4

∙ 08/15/2018

A new coinductive confluence proof for infinitary lambda-calculus

We present a new and formal coinductive proof of confluence and normalis...

0 Łukasz Czajka, et al. ∙

∙ 04/18/2018

Partial Regularization of First-Order Resolution Proofs

Resolution and superposition are common techniques which have seen wides...

0 Jan Gorzny, et al. ∙

∙ 10/13/2022

Towards Uniform Certification in QBF

We pioneer a new technique that allows us to prove a multitude of previo...

0 Leroy Chew, et al. ∙

∙ 01/09/2022

On proof theory in computational complexity: overview

In [GH1] and [GH2] (see also [GH3]) we presented full proof of the equal...

0 L. Gordeev, et al. ∙

∙ 02/27/2018

Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables

This paper studies specifications and proofs of distributed algorithms w...

0 Saksham Chand, et al. ∙

∙ 05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...

0 Mika Göös, et al. ∙

∙ 09/17/2020

On the Intrinsic Redundancy in Huge Natural Deduction proofs II: Analysing M_ Super-Polynomial Proofs

This article precisely defines huge proofs within the system of Natural ...

0 Edward Hermann Haeusler, et al. ∙