On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems

Ohlebusch, Enno

doi:10.1007/10705424_12

Search citation statements

Order By: Relevance

Paper Sections

Select...

Discussion1

Unravelings1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2001

2017

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use the so-called sequential unraveling, a simple transformation for deterministic CTRSs that was introduced in [18] based on [14].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Confluence of Conditional Term Rewrite Systems via Transformations

Gmeiner

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems.Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with certain syntactic properties like weak left-linearity. These syntactic properties imply that the transformations are sound for the given CTRS.This paper shows how to use transformations to prove confluence of operationally terminating, right-stable deterministic conditional term rewrite systems without the necessity of soundness restrictions. For this purpose, it is shown that certain rewrite strategies, in particular almost U-eagerness and innermost rewriting, always imply soundness.

show abstract

“…We use the so-called sequential unraveling, a simple transformation for deterministic CTRSs that was introduced in [18] based on [14].…”

Section: Discussionmentioning

confidence: 99%

“…The sequential unraveling that was introduced in [18] (a similar unraveling was already defined in [14]) extends this approach to DCTRSs. Definition 1 (sequential unraveling U seq [18]). Given a deterministic conditional rule α : l → r ⇐ s 1 → * t 1 , .…”

Section: Unravelingsmentioning

confidence: 99%