DeepAI AI Chat
Log In Sign Up

A Tableaux Calculus for Reducing Proof Size

by   Michael Peter Lettmann, et al.
Université Grenoble Alpes
TU Wien

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.


page 1

page 2

page 3

page 4


On Up-to Context Techniques in the π-calculus

We present a variant of the theory of compatible functions on relations,...

Focus-style proof systems and interpolation for the alternation-free μ-calculus

In this paper we introduce a cut-free sequent calculus for the alternati...

A circular proof system for the hybrid mu-calculus

We present a circular and cut-free proof system for the hybrid mu-calcul...

A Proof Procedure For Separation Logic With Inductive Definitions and Theory Reasoning

A proof procedure, in the spirit of the sequent calculus, is proposed to...

SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning

We show that SCL(FOL) can simulate the derivation of non-redundant claus...

Extensible Proof Systems for Infinite-State Systems

This paper revisits soundness and completeness of proof systems for prov...

An Interactive Proof of Termination for a Concurrent λ-calculus with References and Explicit Substitutions

In this paper we introduce a typed, concurrent λ-calculus with reference...