The following pages link to Termination of rewriting (Q1098624):
Displaying 50 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Natural termination (Q673622) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Termination by completion (Q757069) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- A completion procedure for conditional equations (Q758211) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Leanest quasi-orderings (Q876045) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Modular term rewriting systems and the termination (Q910207) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- On the recursive decomposition ordering with lexicographical status and other related orderings (Q912609) (← links)
- Automated proofs of the Moufang identities in alternative rings (Q912653) (← links)
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
- Chain properties of rule closures (Q916402) (← links)
- A note on division orderings on strings (Q918714) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Extension functions for multiset orderings (Q1104349) (← links)
- On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Some experiments with a completion theorem prover (Q1186705) (← links)
- Associative-commutative reduction orderings (Q1198005) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- A field guide to equational logic (Q1201350) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- Rationality of division orderings (Q1209367) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
