Matrix Interpretations for Proving Termination of Term Rewriting
From MaRDI portal
Publication:3613435
DOI10.1007/11814771_47zbMath1222.68362OpenAlexW1558166004MaRDI QIDQ3613435
Johannes Waldmann, Jörg Endrullis, Hans Zantema
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://research.vu.nl/ws/files/2410076/219625.pdf
Related Items
Automatic synthesis of logical models for order-sorted first-order theories ⋮ Tyrolean termination tool: techniques and features ⋮ Arctic Termination ...Below Zero ⋮ Root-Labeling ⋮ Normalization of Infinite Terms ⋮ Matrix interpretations for proving termination of term rewriting ⋮ Certification of Proving Termination of Term Rewriting by Matrix Interpretations ⋮ From Outermost to Context-Sensitive Rewriting ⋮ Proving Infinitary Normalization ⋮ Proving Termination with (Boolean) Satisfaction ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ Search Techniques for Rational Polynomial Orders
Uses Software
