Date: 2006-07-26 07:36:55Theoretical computer science Mathematics Mathematical logic Logic in computer science Rewriting Termination analysis International Conference on Rewriting Techniques and Applications Algorithm Dependency graph Path ordering Polynomial | | Automated Termination Proofs with AProVE? J¨ urgen Giesl, Ren´e Thiemann, Peter Schneider-Kamp, Stephan Falke LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany {giesl|thiemann|psk}@informatik.rwth-aaAdd to Reading ListSource URL: www-i2.informatik.rwth-aachen.deDownload Document from Source Website File Size: 384,33 KBShare Document on Facebook
|