Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
126
click to vote
SOFSEM
2007
Springer
118
views
Theoretical Computer Science
»
more
SOFSEM 2007
»
Constraints for Argument Filterings
15 years 9 months ago
Download
cl-informatik.uibk.ac.at
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
claim paper
Read More »