The following pages link to (Q3703288):
Displaying 30 items.
- On word problems in Horn theories (Q757095) (← links)
- Termination orders for 3-polygraphs (Q817890) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
- A geometrical approach to multiset orderings (Q1119955) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Complexity analysis of term-rewriting systems (Q1262761) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Pattern-matching algorithms based on term rewrite systems (Q1575262) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Automatic proofs by induction in theories without constructors (Q1824382) (← links)
- Outside opportunities and termination (Q2347777) (← links)
- Cancellation (Q2948960) (← links)
- Local Termination (Q3636830) (← links)
- Extension orderings (Q4645205) (← links)
- A local termination property for term rewriting systems (Q5055724) (← links)
- Priority rewriting: Semantics, confluence, and conditionals (Q5055727) (← links)
- Negation with logical variables in conditional rewriting (Q5055728) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- Topics in termination (Q5055795) (← links)
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169) (← links)
- Termination of processes (Q5466792) (← links)
- On sufficient completeness of conditional specifications (Q5881283) (← links)
- An universal termination condition for solving goals in equational languages (Q5881302) (← links)
- Dismissal power (Q6157851) (← links)
