KBCV – Knuth-Bendix Completion Visualizer

  • Thomas Sternagel
  • Harald Zankl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7364)

Abstract

This paper describes a tool for Knuth-Bendix completion. In its interactive mode the user only has to select the orientation of equations into rewrite rules; all other computations (including necessary termination checks) are performed internally. Apart from the interactive mode, the tool also provides a fully automatic mode. Moreover, the generation of (dis)proofs in equational logic is supported. Finally, the tool outputs proofs in a certifiable format.

Keywords

term rewriting completion equational logic automation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1999)MATHGoogle Scholar
  2. 2.
    Bachmair, L., Dershowitz, N.: Equational inference, canonical proofs, and proof orderings. Journal of the ACM 41(2), 236–276 (1994)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Bachmair, L., Dershowitz, N., Plaisted, D.: Completion without failure. In: Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol. 2, pp. 1–30 (1989)Google Scholar
  4. 4.
    Huet, G.P.: A complete proof of correctness of the Knuth-Bendix completion algorithm. J. Comput. Syst. Sci. 23(1), 11–21 (1981)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Klein, D., Hirokawa, N.: Maximal completion. In: Schmidt-Schauß, M. (ed.) RTA 2011. LIPIcs, vol. 10, pp. 71–80. Schloss Dagstuhl, Dagstuhl (2011)Google Scholar
  6. 6.
    Korp, M., Sternagel, C., Zankl, H., Middeldorp, A.: Tyrolean Termination Tool 2. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 295–304. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Lescanne, P.: Completion Procedures as Transition Rules + Control. In: Díaz, J., Orejas, F. (eds.) TAPSOFT 1989. LNCS, vol. 351, pp. 28–41. Springer, Heidelberg (1989)Google Scholar
  8. 8.
    Sato, H., Winkler, S., Kurihara, M., Middeldorp, A.: Multi-completion with Termination Tools (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 306–312. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Sternagel, T., Thiemann, R., Zankl, H., Sternagel, C.: Recording completion for finding and certifying proofs in equational logic. In: IWC (2012)Google Scholar
  10. 10.
    Thiemann, R., Sternagel, C.: Certification of Termination Proofs Using CeTA. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 452–468. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Wehrman, I., Stump, A., Westbrook, E.: Slothrop: Knuth-Bendix Completion with a Modern Termination Checker. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 287–296. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Thomas Sternagel
    • 1
    • 2
  • Harald Zankl
    • 2
  1. 1.Master Program in Computer ScienceUniversity of InnsbruckAustria
  2. 2.Institute of Computer ScienceUniversity of InnsbruckAustria

Personalised recommendations