Reachability in Conditional Term Rewriting Systems

DOI10.1016/S1571-0661(04)80658-3zbMath1261.68099OpenAlexW2018810851MaRDI QIDQ4916227

Thomas Genet, Guillaume Feuillade

Publication date: 19 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80658-3

Mathematics Subject Classification ID

Related Items (7)

Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Reversible computation in term rewriting ⋮ Some decidability results on one-pass reductions ⋮ On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Reachability in Conditional Term Rewriting Systems ⋮ Reachability analysis over term rewriting systems

Uses Software

• ELAN
• Maude
• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maude: specification and programming in rewriting logic
• Elimination of conditions
• Toward the concurrent implementation of computational systems
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Reachability in Conditional Term Rewriting Systems

This page was built for publication: Reachability in Conditional Term Rewriting Systems