The following pages link to Termination of rewriting (Q1098624):
Displaying 50 items.
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- Simplification orderings: Putting them to the test (Q1311404) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Automated proofs of equality problems in Overbeek's competition (Q1319385) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- An overview of the Tecton proof system (Q1341710) (← links)
- Simple termination is difficult (Q1343111) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- Binary decision diagrams for first-order predicate logic. (Q1426055) (← links)
- Pattern-matching algorithms based on term rewrite systems (Q1575262) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Zero, successor and equality in BDDs (Q1772774) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- On terminating lemma speculations. (Q1854370) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- The data type variety of stack algebras (Q1891249) (← links)
- A path ordering for proving termination of AC rewrite systems (Q1891259) (← links)
- Head boundedness of nonterminating rewritings (Q1894332) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- A calculus for and termination of rippling (Q1915137) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Reasoning with conditional axioms (Q1924731) (← links)
- An improved general path order (Q1925013) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories (Q2122211) (← links)
