Termination of rewriting systems by polynomial interpretations and its implementation
From MaRDI portal
(Redirected from Publication:579930)
Recommendations
- Termination of rewrite systems by elementary interpretations
- 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
- Termination of rewriting
- Generating polynomial orderings
- Termination of term rewriting by interpretation
Cited in
(57)- AC completion with termination tools
- Improving associative path orderings
- Total termination of term rewriting
- Cancellative Abelian monoids and related structures in refutational theorem proving. I
- Total termination of term rewriting
- Chain properties of rule closures
- A fully syntactic AC-RPO.
- Completion for rewriting modulo a congruence
- Termination proofs and the length of derivations
- Invariants, patterns and weights for ordering terms
- Open problems in rewriting
- Automatic Termination
- The order types of termination orderings on monadic terms, strings and multisets
- Any ground associative-commutative theory has a finite canonical system
- A term rewriting characterization of the functions computable in polynomial space
- Conditional narrowing modulo a set of equations
- Schematization of infinite sets of rewrite rules generated by divergent completion processes
- A path ordering for proving termination of AC rewrite systems
- Generating polynomial orderings for termination proofs
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- Proving termination by dependency pairs and inductive theorem proving
- Polynomials over the reals in proofs of termination : from theory to practice
- A complete superposition calculus for primal grammars
- Size-based termination of higher-order rewriting
- Mechanically proving termination using polynomial interpretations
- Proving termination of (conditional) rewrite systems. A semantic approach
- More problems in rewriting
- SAT solving for termination proofs with recursive path orders and dependency pairs
- AC-KBO revisited
- REVE
- Termination of term rewriting using dependency pairs
- Polynomial interpretations for higher-order rewriting
- Generating polynomial orderings
- Automating the Knuth Bendix ordering
- Termination by completion
- Termination of constructor systems
- Weights for total division orderings on strings
- Linear interpretations by counting patterns
- Termination of term rewriting by interpretation
- Termination Modulo Combinations of Equational Theories
- AC-termination of rewrite systems: a modified Knuth-Bendix ordering
- Automated deduction with associative-commutative operators
- Outermost ground termination
- 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
- Modular and incremental proofs of AC-termination
- Path orderings for termination of associative-commutative rewriting
- Incremental termination proofs and the length of derivations
- Topics in termination
- A precedence-based total AC-compatible ordering
- Extension of the associative path ordering to a chain of associative commutative symbols
- Termination of rewrite systems by elementary interpretations
- Termination of string rewriting proved automatically
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- Polynomial termination over \(\mathbb{N}\) is undecidable
- A total AC-compatible ordering based on RPO
- Natural termination
- Automatic proofs of termination with elementary interpretations
This page was built for publication: Termination of rewriting systems by polynomial interpretations and its implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579930)
