Generating Schemata of Resolution Proofs

06/14/2011
by   Vincent Aravantinos, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2018

A new coinductive confluence proof for infinitary lambda-calculus

We present a new and formal coinductive proof of confluence and normalis...
research
04/18/2018

Partial Regularization of First-Order Resolution Proofs

Resolution and superposition are common techniques which have seen wides...
research
10/13/2022

Towards Uniform Certification in QBF

We pioneer a new technique that allows us to prove a multitude of previo...
research
06/09/2023

A Complete Proof Synthesis Method for the Cube of Type Systems

We present a complete proof synthesis method for the eight type systems ...
research
05/04/2021

A Subatomic Proof System for Decision Trees

We design a proof system for propositional classical logic that integrat...
research
05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...
research
01/13/2020

Tabled Typeclass Resolution

Typeclasses provide an elegant and effective way of managing ad-hoc poly...

Please sign up or login with your details

Forgot password? Click here to reset