Tableau vs. Sequent Calculi for Minimal Entailment
Logic in Computer Science
2014-05-08 v1
Abstract
In this paper we compare two proof systems for minimal entailment: a tableau system OTAB and a sequent calculus MLK, both developed by Olivetti (1992). Our main result shows that OTAB-proofs can be efficiently translated into MLK-proofs, i.e; MLK p-simulates OTAB. The simulation is technically very involved and answers an open question posed by Olivetti (1992) on the relation between the two calculi. We also show that the two systems are exponentially separated, i.e; there are formulas which have polynomial size MLK-proofs, but require exponential-size OTAB- proofs.
Keywords
Cite
@article{arxiv.1405.1565,
title = {Tableau vs. Sequent Calculi for Minimal Entailment},
author = {Olaf Beyersdorff and Leroy Chew},
journal= {arXiv preprint arXiv:1405.1565},
year = {2014}
}
Comments
9 pages, 3 figures, this paper appears in the Proceedings of the 15th International Workshop on Non-Monotonic Reasoning (NMR 2014)