Pages that link to "Item:Q4916227"
From MaRDI portal
The following pages link to Reachability in Conditional Term Rewriting Systems (Q4916227):
Displaying 13 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- A finiteness condition for rewriting systems (Q1331943) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Reversible computation in term rewriting (Q1683707) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Specification inference using context-free language reachability (Q2819840) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- (Q3146285) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)