Termination of Order-Sorted Rewriting with Non-minimal Signatures
Summary :
In this paper, we extend the Gnaedig's results on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.8 pp.839-845
- Publication Date
- 1998/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Software Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoshinobu KAWABE, Naohiro ISHII, "Termination of Order-Sorted Rewriting with Non-minimal Signatures" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 8, pp. 839-845, August 1998, doi: .
Abstract: In this paper, we extend the Gnaedig's results on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_8_839/_p
Copy
@ARTICLE{e81-d_8_839,
author={Yoshinobu KAWABE, Naohiro ISHII, },
journal={IEICE TRANSACTIONS on Information},
title={Termination of Order-Sorted Rewriting with Non-minimal Signatures},
year={1998},
volume={E81-D},
number={8},
pages={839-845},
abstract={In this paper, we extend the Gnaedig's results on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Termination of Order-Sorted Rewriting with Non-minimal Signatures
T2 - IEICE TRANSACTIONS on Information
SP - 839
EP - 845
AU - Yoshinobu KAWABE
AU - Naohiro ISHII
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1998
AB - In this paper, we extend the Gnaedig's results on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.
ER -
English
