Slothrop

swMATH10019MaRDI QIDQ21994FDOQ21994

Author name not available (Why is that?)

Described by source

• Slothrop: Knuth-Bendix Completion with a Modern Termination Checker

Cited In (11)

• A lower bound of the number of rewrite rules obtained by homological methods
• Proving injectivity of functions via program inversion in term rewriting
• Multi-completion with Termination Tools (System Description)
• Encoding dependency pair techniques and control strategies for maximal completion
• Title not available (Why is that?)
• Multi-completion with termination tools
• Paramodulation with non-monotonic orderings and simplification
• Completion for logically constrained rewriting
• KBCV – Knuth-Bendix Completion Visualizer
• Completion after program inversion of injective functions
• AC completion with termination tools

This page was built for software: Slothrop