Multi-completion with Termination Tools (System Description)
In this paper we describe a new tool for performing Knuth-Bendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for completion with multiple reduction orderings introduced by Kurihara and Kondo (1999) and (2) the inference system for completion with external termination provers proposed by Wehrman, Stump and Westbrook (2006) and implemented in the Slothrop system. Our tool can be used with any termination tool that satisfies certain minimal requirements. Preliminary experimental results show the potential of our tool.
Unable to display preview. Download preview PDF.
- 2.Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford (1970)Google Scholar
- 4.Sattler-Klein, A.: About changing the ordering during Knuth-Bendix completion. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 175–186. Springer, Heidelberg (1994)Google Scholar
- 6.Wehrman, I.: Knuth-Bendix completion with modern termination checking. Master’s thesis, Washington University in St. Louis, Technical report WUCSE-2006-45 (2006)Google Scholar