Termination by completion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4007716 (Why is no real title available?)
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Orderings for term-rewriting systems
- Path of subterms ordering and recursive decomposition ordering revisited
- Proof of termination of the rewriting system SUBSET on CCL
- Rewriting systems on FP expressions to reduce the number of sequences yielded
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
Cited in
(27)- Dummy elimination in equational rewriting
- Dummy elimination: Making termination easier
- Abstract abstract reduction
- Finding small counterexamples for abstract rewriting properties
- Jumping and escaping: modular termination and the abstract path ordering
- Maximal completion
- Transforming termination by self-labelling
- Proof of termination of the rewriting system SUBSET on CCL
- Completion-time optimization of rewrite-time goal solving
- Constructing Rewrite-Based Decision Procedures for Embeddings and Termination
- scientific article; zbMATH DE number 4090770 (Why is no real title available?)
- Termination of rewrite systems by elementary interpretations
- Termination of term rewriting using dependency pairs
- scientific article; zbMATH DE number 3921958 (Why is no real title available?)
- On proving properties of completion strategies
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies
- An improved general path order
- Term rewriting induction
- Automating the dependency pair method
- Program transformation and rewriting
- Summarization for termination: No return!
- Termination modulo equations by abstract commutation with an application to iteration
- Automatic termination proofs with transformation orderings
- Termination of constructor systems
- A complete characterization of termination of 0p 1q→1r 0s
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- Termination of processes
This page was built for publication: Termination by completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757069)
