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 can reduce the size of the proof. It is shown that the obtained proof procedure is sound, refutationally complete and can reduce the size of the tableau by an exponential factor. The approach is compatible with all usual refinements of tableaux.
M.P. Lettmann—Funded by FWF project W1255-N23.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We recall that the cut rule consists in expanding a tableau by adding two branches with \(\lnot \phi \) and \(\phi \) respectively, where \(\phi \) is any formula (intuitively \(\phi \) can be viewed as a lemma). A cut is atomic if \(\phi \) is atomic.
- 2.
Due to the limited number of pages, we omit proofs that are not necessary for the understanding of the method. A full version can be found in [10].
- 3.
Note that both ordinary and abstraction variables are renamed.
- 4.
Actually, due to the above conditions, the variables in \(\mathrm {dom}(\theta )\) only occur in the subtree of root \(\mu \), hence \(\theta \) only affects this subtree.
- 5.
Connection tableaux can be seen as ordinary tableaux in which any application of the Expansion rule must be followed by the closure of a branch, using one of the newly added literals and the previous literal in the branch.
- 6.
Hyper-tableaux may be viewed in our framework as ordinary tableaux in which the Expansion rule must be followed by the closure of all the newly added branches containing negative literals.
- 7.
In a \(\varPi _2\)-cut, the cut formula is of the form \(\forall x\exists yA\) where A is a quantifier-free formula.
References
Baumgartner, P.: Hyper tableau—the next generation. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 60–76. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-69778-0_14
de Rijke, M.: In: D’Agostino, M., Gabbay, D.M., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods (2001). J. Logic, Lang. Inform. 10(4), 518–523
Eder, E.: Relative Complexities of First-Order Logic Calculi. Springer, Heidelberg (1990). https://doi.org/10.1007/978-3-322-84222-0
Fitting, M.: First-Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer, New York (1990). https://doi.org/10.1007/978-1-4684-0357-2
Giese, M.: Incremental closure of free variable tableaux. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 545–560. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45744-5_46
Hähnle, R.: Tableaux and related methods. In Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, chap. 3, pp. 100–178. Elsevier Science (2001)
Hansen, C.M., Antonsen, R., Giese, M., Waaler, A.: Incremental variable splitting. J. Symb. Comput. 47(9), 1046–1065 (2012)
Hetzl, S., Leitsch, A., Reis, G., Weller, D.: Algorithmic introduction of quantified cuts. Theoret. Comput. Sci. 549, 1–16 (2014)
Leitsch, A., Lettmann, M.P.: The problem of \(\Pi_{2}\)-cut-introduction. Theoret. Comput. Sci. 706, 83–116 (2018)
Lettmann, M.P., Peltier, N.: A tableaux calculus for reducing proof size. In: CoRR, abs/1801.04163 (2018)
Letz, R., Mayr, K., Goller, C.: Controlled integration of the cut rule into connection tableau calculi. J. Autom. Reason. 13(3), 297–337 (1994)
Letz, R., Stenz, G.: Model elimination and connection tableau procedures. In: Handbook of Automated Reasoning, pp. 2015–2112. Elsevier Science Publishers B. V., Amsterdam (2001)
Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2. Elsevier and MIT Press (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Lettmann, M.P., Peltier, N. (2018). A Tableaux Calculus for Reducing Proof Size. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds) Automated Reasoning. IJCAR 2018. Lecture Notes in Computer Science(), vol 10900. Springer, Cham. https://doi.org/10.1007/978-3-319-94205-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-94205-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94204-9
Online ISBN: 978-3-319-94205-6
eBook Packages: Computer ScienceComputer Science (R0)