Solution to the problem of Zantema on a persistent property of term rewriting systems

Takahito Aoto

doi:10.1007/bfb0056618

Solution to the problem of Zantema on a persistent property of term rewriting systems

Takahito Aoto

Systems & Software Division

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.

Original language	English
Title of host publication	Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings
Editors	Catuscia Palamidessi, Hugh Glaser, Karl Meinke
Publisher	Springer Verlag
Pages	250-265
Number of pages	16
ISBN (Print)	3540650121, 9783540650126
DOIs	https://doi.org/10.1007/bfb0056618
Publication status	Published - 1998
Event	10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998 - Pisa, Italy Duration: 1998 Sep 16 → 1998 Sep 18

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1490
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998
Country	Italy
City	Pisa
Period	98/9/16 → 98/9/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/bfb0056618

Fingerprint Dive into the research topics of 'Solution to the problem of Zantema on a persistent property of term rewriting systems'. Together they form a unique fingerprint.

Cite this

Aoto, T. (1998). Solution to the problem of Zantema on a persistent property of term rewriting systems. In C. Palamidessi, H. Glaser, & K. Meinke (Eds.), Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings (pp. 250-265). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1490). Springer Verlag. https://doi.org/10.1007/bfb0056618

Solution to the problem of Zantema on a persistent property of term rewriting systems. / Aoto, Takahito.

Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings. ed. / Catuscia Palamidessi; Hugh Glaser; Karl Meinke. Springer Verlag, 1998. p. 250-265 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1490).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Aoto, T 1998, Solution to the problem of Zantema on a persistent property of term rewriting systems. in C Palamidessi, H Glaser & K Meinke (eds), Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1490, Springer Verlag, pp. 250-265, 10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998, Pisa, Italy, 98/9/16. https://doi.org/10.1007/bfb0056618

Aoto T. Solution to the problem of Zantema on a persistent property of term rewriting systems. In Palamidessi C, Glaser H, Meinke K, editors, Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings. Springer Verlag. 1998. p. 250-265. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/bfb0056618

Aoto, Takahito. / Solution to the problem of Zantema on a persistent property of term rewriting systems. Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings. editor / Catuscia Palamidessi ; Hugh Glaser ; Karl Meinke. Springer Verlag, 1998. pp. 250-265 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{585a8486027c42518df277da8b75e158,

title = "Solution to the problem of Zantema on a persistent property of term rewriting systems",

abstract = "A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.",

author = "Takahito Aoto",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998 ; Conference date: 16-09-1998 Through 18-09-1998",

year = "1998",

doi = "10.1007/bfb0056618",

language = "English",

isbn = "3540650121",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "250--265",

editor = "Catuscia Palamidessi and Hugh Glaser and Karl Meinke",

booktitle = "Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings",

}

TY - GEN

T1 - Solution to the problem of Zantema on a persistent property of term rewriting systems

AU - Aoto, Takahito

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.

AB - A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.

UR - http://www.scopus.com/inward/record.url?scp=84947707191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947707191&partnerID=8YFLogxK

U2 - 10.1007/bfb0056618

DO - 10.1007/bfb0056618

M3 - Conference contribution

AN - SCOPUS:84947707191

SN - 3540650121

SN - 9783540650126

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 250

EP - 265

BT - Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings

A2 - Palamidessi, Catuscia

A2 - Glaser, Hugh

A2 - Meinke, Karl

PB - Springer Verlag

T2 - 10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998

Y2 - 16 September 1998 through 18 September 1998

ER -

Solution to the problem of Zantema on a persistent property of term rewriting systems

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this