A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems

Kohl, Christina; Middeldorp, Aart

doi:10.1145/3573105.3575667

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Book1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Confluence of Logically Constrained Rewrite Systems Revisited

Schöpf,

Mitterwallner,

Middeldorp

2024

Automated Reasoning

View full text Add to dashboard Cite

We show that (local) confluence of terminating logically constrained rewrite systems is undecidable, even when the underlying theory is decidable. Several confluence criteria for logically constrained rewrite systems are known. These were obtained by replaying existing proofs for plain term rewrite systems in a constrained setting, involving a non-trivial effort. We present a simple transformation from logically constrained rewrite systems to term rewrite systems such that critical pairs of the latter correspond to constrained critical pairs of the former. The usefulness of the transformation is illustrated by lifting the advanced confluence results based on (almost) development closed critical pairs as well as on parallel critical pairs to the constrained setting.

show abstract