Abstract
Variable splitting is a technique applicable to free variable tableaux, sequent calculi, and matrix characterizations that exploits a relationship between β- and γ-rules. Using contextual information to differentiate between occurrences of the same free variable in different branches, the technique admits conditions under which these occurrences may safely be assigned different values by substitutions. This article investigates a system of variable splitting and shows its consistency by a semantical argument. The splitting system is liberalized with respect to β-inferences analogously to a well-known liberalization of δ-rules, and this is used to show an exponential speedup compared to free variable systems without splitting.
References
Andrews, P.B.: Theorem proving via general matings. J. Assoc. Comput. Mach. 28(2), 193–214 (1981)
Antonsen, R.: Uniform variable splitting. In: Contributions to the Doctoral Programme of the Second International Joint Conference on Automated Reasoning (IJCAR 2004), Cork, Ireland, July 4–8 2004, vol. 106, pp. 1–5. CEUR Workshop Proceedings http://ceur-ws.org/Vol-106/01-antonsen.pdf (2004)
Antonsen, R., Waaler, A.: Consistency of variable splitting in free variable systems of first-order logic. In: Beckert, B. (ed.) Automated Reasoning with Analytic Tableaux and Related Methods: 14th International Conference, TABLEAUX, Koblenz, Germany. Lecture Notes in Computer Science, vol. 3702, pp. 33–47. Springer, Berlin Heidelberg New York (2005)
Baaz, M., Fermüller, C.G.: Non-elementary speedups between different versions of tableaux. In: Baumgartner, R.H. Peter, Possega J. (eds.) 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods. Lecture Notes in Artificial Intelligence, vol. 918, pp. 217–230. Springer, Berlin Heidelberg New York (1995)
Beckert, B., Goré, R.: Free-variable tableaux for propositional modal logics. Stud. Log. 69(1), 59–96 (2001)
Beckert, B., Hähnle, R.: An improved method for adding equality to free variable semantic tableaux. In: Kapur, D.(ed.) Proceedings, 11th International Conference on Automated Deduction (CADE), Saratoga Springs, NY, pp. 507–521 (1992)
Beckert, B., Hähnle, R., Schmitt, P.H.: The even more liberalized δ-rule in free variable semantic tableaux. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) Proceedings of the Third Kurt Gödel Colloquium KGC’93, Brno, Czech Republic. Lecture Notes in Computer Science, vol. 713, pp. 108–119. Springer, Berlin Heidelberg New York (1993)
Bibel, W.: Computationally improved versions of Herbrand’s theorem. In: Logic Colloquium 81, pp. 11–28. North Holland, Amsterdam, The Netherlands (1982)
Bibel, W.: Automated Theorem Proving, 2nd edn. Vieweg Verlag, Brunswick, Germany (1987)
Fitting, M.C.: First-order logic and automated theorem proving. In: Graduate Texts in Computer Science, 2nd edn. Springer, Berlin Heidelberg New York (1996)
Giese, M.: Incremental closure of free variable tableaux. In: Proceedings of International Joint Conference on Automated Reasoning, Siena, Italy, pp. 545–560. Springer, Berlin Heidelberg New York (2001)
Hähnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, chap. 3, pp. 100–178. Elsevier, Amsterdam, The Netherlands (2001)
Kanger, S.: A simplified proof method for elementary logic. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning 1: Classical Papers on Computational Logic 1957–1966, pp. 364–371. Springer, Berlin Heidelberg New York (1983)
Konev, B., Jebelean, T.: Using meta-variables for natural deduction in theorema. In: Symbolic Computation and Automated Reasoning, Natick, MA, pp. 159–174 (2001)
Letz, R.: Clausal tableaux. In: Bibel, W., Schmidt, P.H. (eds.) Automated Deduction: A Basis for Applications Foundations: Calculi and Methods, vol. I. Kluwer, Dordrecht, The Netherlands (1998)
Letz, R., Stenz, G.: Universal variables in disconnection tableaux. In: Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX, Rome, Italy. Lecture Notes in Computer Science, pp. 117–133. Springer, Berlin Heidelberg New York (2003)
Otten, J., Bibel, W.: leanCoP: lean connection-based theorem proving. J. Symb. Comput. 36(1–2), 139–161 (2003)
Prawitz, D.: An improved proof procedure. Theoria 26, 102–139 (1960) (Reprinted in [19])
Siekmann, J., Wrightson, G.: Automation of Reasoning: Classical Papers in Computational Logic 1957–1966, vol. 1. Springer, Berlin Heidelberg New York (1983)
Smullyan, R.M.: First-order logic. In: Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 43. Springer, Berlin Heidelberg New York (1968)
Waaler, A.: Connections in nonclassical logics. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, chap. 22, pp. 1487–1578. Elsevier, Amsterdam, The Netherlands (2001)
Waaler, A., Antonsen, R.: A free variable sequent calculus with uniform variable splitting. In: Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX, Rome. Lecture Notes in Computer Science, pp. 214–229. Springer, Berlin Heidelberg New York (2003)
Wallen, L.A.: Automated Deduction in Nonclassical Logics. MIT, Cambridge, MA (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Antonsen, R., Waaler, A. Liberalized Variable Splitting. J Autom Reasoning 38, 3–30 (2007). https://doi.org/10.1007/s10817-006-9055-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-006-9055-9