Skip to main content
Conference Proceedings

Automatic termination proofs with transformation orderings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 914 11-25
DOI: 10.1007/3-540-59200-8_44
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Transformation orderings are a powerful tool for proving termination of term rewriting systems. However, it is rather hard to establish their applicability to a given rule system. We introduce an algorithm which automatically generates transformation orderings for many nontrivial systems including Hercules & hydra and sorting algorithms.

Cite

CITATION STYLE

APA

Steinbach, J. (1995). Automatic termination proofs with transformation orderings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 914, pp. 11–25). Springer Verlag. https://doi.org/10.1007/3-540-59200-8_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free