Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
From MaRDI portal
Publication:3527302
DOI10.1007/11805618_22zbMath1151.68456OpenAlexW2161751413MaRDI QIDQ3527302
Aaron Stump, Edwin Westbrook, Ian Wehrman
Publication date: 25 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11805618_22
Related Items
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods, Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion, Multi-completion with termination tools, Paramodulation with non-monotonic orderings and simplification, Unnamed Item, Order Reconfiguration under Width Constraints, Towards automated deduction in cP systems, Multi-completion with Termination Tools (System Description), Completion after Program Inversion of Injective Functions, Termination Tools in Ordered Completion, AC Completion with Termination Tools, Slothrop
Uses Software
