Termination tools in ordered completion

Authors:
Sarah Winkler;Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Year:
2010

Citing 9
Cited 2

Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
Total termination of term rewriting is undecidable

Journal of Symbolic Computation
Completion for Multiple Reduction Orderings

Journal of Automated Reasoning
Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings

Journal of Automated Reasoning
The Next W ALDMEISTER Loop

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
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
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Slothrop: Knuth-Bendix completion with a modern termination checker

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

Ordinals and knuth-bendix orders

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Paramodulation with Non-Monotonic Orderings and Simplification

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ordered completion is one of the most frequently used calculi in equational theorem proving. The performance of an ordered completion run strongly depends on the reduction order supplied as input. This paper describes how termination tools can replace fixed reduction orders in ordered completion procedures, thus allowing for a novel degree of automation. Our method can be combined with the multi-completion approach proposed by Kondo and Kurihara. We present experimental results obtained with our ordered completion tool omkbTT for both ordered completion and equational theorem proving.