Pages that link to "Item:Q579930"
From MaRDI portal
The following pages link to Termination of rewriting systems by polynomial interpretations and its implementation (Q579930):
Displaying 50 items.
- REVE (Q40621) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Natural termination (Q673622) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Termination by completion (Q757069) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Chain properties of rule closures (Q916402) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- A fully syntactic AC-RPO. (Q1400715) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Termination of rewrite systems by elementary interpretations (Q1805401) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. I (Q1864898) (← links)
- A path ordering for proving termination of AC rewrite systems (Q1891259) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- A complete superposition calculus for primal grammars (Q2352496) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- (Q2851054) (← links)
- Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm (Q3357550) (← links)
- Automatic Termination (Q3636815) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- AC-KBO revisited (Q4593023) (← links)
- Termination proofs and the length of derivations (Q5055719) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Topics in termination (Q5055795) (← links)
- Total termination of term rewriting (Q5055796) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- More problems in rewriting (Q5055812) (← links)
- Generating polynomial orderings for termination proofs (Q5055845) (← links)
- Termination of constructor systems (Q5055852) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
- AC Completion with Termination Tools (Q5200044) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
