Multi-completion with Termination Tools (System Description)

Authors:
Haruhiko Sato;Sarah Winkler;Masahito Kurihara;Aart Middeldorp
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Japan;Institute of Computer Science, University of Innsbruck, Austria;Graduate School of Information Science and Technology, Hokkaido University, Japan;Institute of Computer Science, University of Innsbruck, Austria
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 5
Cited 5

Completion for Multiple Reduction Orderings

Journal of Automated Reasoning
About Changing the Ordering During Knuth-Bendix Completion

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Knuth--Bendix completion of theories of commuting group endomorphisms

Information Processing Letters
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Slothrop: Knuth-Bendix completion with a modern termination checker

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

Multiple Light Source Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
AC completion with termination tools

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Termination tools in ordered completion

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
KBCV: knuth-bendix completion visualizer

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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 Slothropsystem. Our tool can be used with any termination tool that satisfies certain minimal requirements. Preliminary experimental results show the potential of our tool.