Abstract
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.
This research is partially supported by FWF (Austrian Science Fund) project P18763 and JSPS Grant-in-Aid for Scientific Research (C), No. 19500020.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281–286. Springer, Heidelberg (2006)
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)
Kurihara, M., Kondo, H.: Completion for multiple reduction orderings. Journal of Automated Reasoning 23(1), 25–42 (1999)
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)
Stump, A., Löchner, B.: Knuth-Bendix completion of theories of commuting group endomorphisms. Information Processing Letters 98(5), 195–198 (2006)
Wehrman, I.: Knuth-Bendix completion with modern termination checking. Master’s thesis, Washington University in St. Louis, Technical report WUCSE-2006-45 (2006)
Wehrman, I., Stump, A., Westbrook, E.M.: Slothrop: Knuth-Bendix completion with a modern termination checker. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 287–296. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sato, H., Winkler, S., Kurihara, M., Middeldorp, A. (2008). Multi-completion with Termination Tools (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds) Automated Reasoning. IJCAR 2008. Lecture Notes in Computer Science(), vol 5195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71070-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-71070-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71069-1
Online ISBN: 978-3-540-71070-7
eBook Packages: Computer ScienceComputer Science (R0)