Rational term rewriting revisited: Decidability and confluence

Takahito Aoto; Jeroen Ketema

doi:10.1007/978-3-642-33654-6_12

Rational term rewriting revisited: Decidability and confluence

Takahito Aoto, Jeroen Ketema

Systems & Software Division

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

3 Citations (Scopus)

Abstract

We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.

Original language	English
Title of host publication	Graph Transformations - 6th International Conference, ICGT 2012, Proceedings
Pages	172-186
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-33654-6_12
Publication status	Published - 2012 Oct 24
Event	6th International Conference on Graph Transformations, ICGT 2012 - Bremen, Germany Duration: 2012 Sep 24 → 2012 Sep 29

Publication series

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

Other

Other	6th International Conference on Graph Transformations, ICGT 2012
Country/Territory	Germany
City	Bremen
Period	12/9/24 → 12/9/29

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-33654-6_12

Cite this

Aoto, T., & Ketema, J. (2012). Rational term rewriting revisited: Decidability and confluence. In Graph Transformations - 6th International Conference, ICGT 2012, Proceedings (pp. 172-186). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7562 LNCS). https://doi.org/10.1007/978-3-642-33654-6_12

Rational term rewriting revisited : Decidability and confluence. / Aoto, Takahito; Ketema, Jeroen.

Graph Transformations - 6th International Conference, ICGT 2012, Proceedings. 2012. p. 172-186 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7562 LNCS).

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

Aoto, T & Ketema, J 2012, Rational term rewriting revisited: Decidability and confluence. in Graph Transformations - 6th International Conference, ICGT 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7562 LNCS, pp. 172-186, 6th International Conference on Graph Transformations, ICGT 2012, Bremen, Germany, 12/9/24. https://doi.org/10.1007/978-3-642-33654-6_12

@inproceedings{a7757469817e46a3afa547f72d3621d5,

title = "Rational term rewriting revisited: Decidability and confluence",

abstract = "We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.",

author = "Takahito Aoto and Jeroen Ketema",

year = "2012",

month = oct,

day = "24",

doi = "10.1007/978-3-642-33654-6_12",

language = "English",

isbn = "9783642336539",

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

pages = "172--186",

booktitle = "Graph Transformations - 6th International Conference, ICGT 2012, Proceedings",

note = "6th International Conference on Graph Transformations, ICGT 2012 ; Conference date: 24-09-2012 Through 29-09-2012",

}

TY - GEN

T1 - Rational term rewriting revisited

T2 - 6th International Conference on Graph Transformations, ICGT 2012

AU - Aoto, Takahito

AU - Ketema, Jeroen

PY - 2012/10/24

Y1 - 2012/10/24

N2 - We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.

AB - We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.

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

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

U2 - 10.1007/978-3-642-33654-6_12

DO - 10.1007/978-3-642-33654-6_12

M3 - Conference contribution

AN - SCOPUS:84867630053

SN - 9783642336539

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

SP - 172

EP - 186

BT - Graph Transformations - 6th International Conference, ICGT 2012, Proceedings

Y2 - 24 September 2012 through 29 September 2012

ER -

Rational term rewriting revisited: Decidability and confluence

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this