Automated termination proofs for logic programs by term rewriting

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Peter Schneider-Kamp University of Southern Denmark, Odense M, Denmark
Jürgen Giesl RWTH Aachen University, Aachen, Germany
Alexander Serebrenik Eindhoven University of Technology, Eindhoven, The Netherlands
René Thiemann University of Innsbruck, Innsbruck, Austria
Automated termination proofs for logic programs by term rewriting Published by ACM 2009 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 21
· Downloads (cumulative): 136
· Citation Count: 13

Published in:
Cover Image
 
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 11 Issue 1, October 2009
Article No. 2
ACM New York, NY, USA
table of contents doi>10.1145/1614431.1614433

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder