KBCV: knuth-bendix completion visualizer

Authors:
Thomas Sternagel;Harald Zankl
Affiliations:
Master Program in Computer Science, University of Innsbruck, Austria, Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 7
Cited 0

Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
Term rewriting and all that

Term rewriting and all that
Completion Procedures as Transition Rules + Control

TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Multi-completion with Termination Tools (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Certification of Termination Proofs Using CeTA

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Slothrop: Knuth-Bendix completion with a modern termination checker

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

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.