3 citations · 3 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2018
A Tableaux Calculus for Reducing Proof Size
Michael Peter Lettmann, Nicolas Peltier
A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are…
cs.LO2016★ 3 cited
The problem of Pi_2-cut-introduction
Alexander Leitsch, Michael Peter Lettmann
We describe an algorithmic method of proof compression based on the introduction of Pi_2-cuts into a cut-free LK-proof. The current approach is based on an inversion of Gentzen s c…