A Tableaux Calculus for Reducing Proof Size

Por • 22 ene, 2018 • Sección: Ambiente

Michael Peter Lettmann, Nicolas Peltier

Abstract: 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 fused when possible, which reduces the size of the proof. It is shown that the obtained proof procedure is sound, refutationally complete and allows to reduce the size of the tableau by an exponential factor. The approach is compatible with all usual refinements of tableaux.

arXiv:1801.04163v1 [cs.LO]

Logic in Computer Science (cs.LO)

Post to Twitter

Escribe un comentario